libavcodec/opus_silk.c:1099: error: Buffer Overrun L2
  Offset: [-14, 16] (⇐ [0, 2] + [-14, 14]) Size: 2 by call to `silk_lsf2lpc`.

libavcodec/opus_silk.c:1034:10: Assignment
1032.     /* obtain LSF stage-1 and stage-2 indices */
1033.     lsf_i1 = opus_rc_getsymbol(rc, silk_model_lsf_s1[s->wb][voiced]);
1034.     for (i = 0; i < order; i++) {
               ^
1035.         int index = s->wb ? silk_lsf_s2_model_sel_wb  [lsf_i1][i] :
1036.                             silk_lsf_s2_model_sel_nbmb[lsf_i1][i];

libavcodec/opus_silk.c:1099:17: Call
1097.                     nlsf_leadin[i] = frame->nlsf[i] +
1098.                         ((nlsf[i] - frame->nlsf[i]) * offset >> 2);
1099.                 silk_lsf2lpc(nlsf_leadin, lpc_leadin, order);
                      ^
1100.             } else  /* avoid re-computation for a (roughly) 1-in-4 occurrence */
1101.                 memcpy(lpc_leadin, frame->lpc, 16 * sizeof(float));

libavcodec/opus_silk.c:934:1: Parameter `order`
  932. }
  933. 
  934. static void silk_lsf2lpc(const int16_t nlsf[16], float lpcf[16], int order)
       ^
  935. {
  936.     int i, k;

libavcodec/opus_silk.c:1004:29: Call
  1002.     /* if the prediction gain causes the LPC filter to become unstable,
  1003.        apply further bandwidth expansion on the Q17 coefficients */
  1004.     for (i = 1; i <= 16 && !silk_is_lpc_stable(lpc, order); i++) {
                                    ^
  1005.         unsigned int chirp, chirp_base;
  1006.         chirp_base = chirp = 65536 - (1 << i);

libavcodec/opus_silk.c:911:14: <Offset trace>
909.         row = lpc32[k & 1];
910. 
911.         for (j = 0; j < k; j++) {
                  ^
912.             int x = prevrow[j] - ROUND_MULL(prevrow[k - j - 1], rc, 31);
913.             row[j] = ROUND_MULL(x, gain, fbits);

libavcodec/opus_silk.c:911:14: Assignment
    909.         row = lpc32[k & 1];
    910. 
    911.         for (j = 0; j < k; j++) {
                      ^
    912.             int x = prevrow[j] - ROUND_MULL(prevrow[k - j - 1], rc, 31);
    913.             row[j] = ROUND_MULL(x, gain, fbits);

libavcodec/opus_silk.c:867:1: <Length trace>
865. }
866. 
867. static inline int silk_is_lpc_stable(const int16_t lpc[16], int order)
     ^
868. {
869.     int k, j, DC_resp = 0;

libavcodec/opus_silk.c:867:1: Array declaration
    865. }
    866. 
    867. static inline int silk_is_lpc_stable(const int16_t lpc[16], int order)
         ^
    868. {
    869.     int k, j, DC_resp = 0;

libavcodec/opus_silk.c:872:5: Assignment
    870.     int32_t lpc32[2][16];       // Q24
    871.     int totalinvgain = 1 << 30; // 1.0 in Q30
    872.     int32_t *row = lpc32[0], *prevrow;
             ^
    873. 
    874.     /* initialize the first row for the Levinson recursion */

libavcodec/opus_silk.c:908:9: Assignment
    906. 
    907.         /* switch to the next row of the LPC coefficients */
    908.         prevrow = row;
                 ^
    909.         row = lpc32[k & 1];
    910. 

libavcodec/opus_silk.c:912:34: Array access: Offset: [-14, 16] (⇐ [0, 2] + [-14, 14]) Size: 2 by call to `silk_lsf2lpc` 
    910. 
    911.         for (j = 0; j < k; j++) {
    912.             int x = prevrow[j] - ROUND_MULL(prevrow[k - j - 1], rc, 31);
                                          ^
    913.             row[j] = ROUND_MULL(x, gain, fbits);
    914.         }
