libavcodec/adpcm.c:427: error: Buffer Overrun L2
  Offset: [0, 2] Size: 2.

libavcodec/adpcm.c:288:28: <Length trace>
286.     TrellisPath paths[max_paths], *p;
287.     TrellisNode node_buf[2][frontier];
288.     TrellisNode *nodep_buf[2][frontier];
                                ^
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
290.     TrellisNode **nodes_next = nodep_buf[1];

libavcodec/adpcm.c:288:28: Array declaration
286.     TrellisPath paths[max_paths], *p;
287.     TrellisNode node_buf[2][frontier];
288.     TrellisNode *nodep_buf[2][frontier];
                                ^
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
290.     TrellisNode **nodes_next = nodep_buf[1];

libavcodec/adpcm.c:289:5: Assignment
287.     TrellisNode node_buf[2][frontier];
288.     TrellisNode *nodep_buf[2][frontier];
289.     TrellisNode **nodes = nodep_buf[0]; // nodes[] is always sorted by .ssd
         ^
290.     TrellisNode **nodes_next = nodep_buf[1];
291.     int pathn = 0, froze = -1, i, j, k;

libavcodec/adpcm.c:427:20: Array access: Offset: [0, 2] Size: 2
425.     }
426. 
427.     c->predictor = nodes[0]->sample1;
                        ^
428.     c->sample1 = nodes[0]->sample1;
429.     c->sample2 = nodes[0]->sample2;
