crypto/bn/bn_gf2m.c:1174: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr`.
Showing all 8 steps of the trace


crypto/bn/bn_gf2m.c:1132:10: Call
1130.           goto err;
1131.   
1132.       if (!BN_GF2m_mod_arr(a, a_, p))
                 ^
1133.           goto err;
1134.   

crypto/bn/bn_gf2m.c:370:1: Parameter `r->top`
  368.   
  369.   /* Performs modular reduction of a and store result in r.  r could be a. */
  370. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
  371.   {
  372.       int j, k;

crypto/bn/bn_gf2m.c:1174:22: Call
1172.                   if (!BN_GF2m_mod_sqr_arr(w2, w, p, ctx))
1173.                       goto err;
1174.                   if (!BN_GF2m_mod_mul_arr(tmp, w2, a, p, ctx))
                             ^
1175.                       goto err;
1176.                   if (!BN_GF2m_add(z, z, tmp))

crypto/bn/bn_gf2m.c:488:1: <Offset trace>
486.    * the result in r.  r could be a or b; a could be b.
487.    */
488. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
489.                           const int p[], BN_CTX *ctx)
490.   {

crypto/bn/bn_gf2m.c:488:1: Parameter `b->top`
  486.    * the result in r.  r could be a or b; a could be b.
  487.    */
  488. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  489.                           const int p[], BN_CTX *ctx)
  490.   {

crypto/bn/bn_gf2m.c:488:1: <Length trace>
486.    * the result in r.  r could be a or b; a could be b.
487.    */
488. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
489.                           const int p[], BN_CTX *ctx)
490.   {

crypto/bn/bn_gf2m.c:488:1: Parameter `*b->d`
  486.    * the result in r.  r could be a or b; a could be b.
  487.    */
  488. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  489.                           const int p[], BN_CTX *ctx)
  490.   {

crypto/bn/bn_gf2m.c:516:40: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
  514.       for (j = 0; j < b->top; j += 2) {
  515.           y0 = b->d[j];
  516.           y1 = ((j + 1) == b->top) ? 0 : b->d[j + 1];
                                                ^
  517.           for (i = 0; i < a->top; i += 2) {
  518.               x0 = a->d[i];
