libavcodec/adpcm.c:421: 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:421:16: Array access: Offset: [0, 2] Size: 2
419.     }
420. 
421.     p = &paths[nodes[0]->path];
                    ^
422.     for(i=n-1; i>froze; i--) {
423.         dst[i] = p->nibble;
