crypto/bn/bn_gf2m.c:1006: 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:998:10: Call
996.           goto err;
997.   
998.       if (!BN_GF2m_mod_arr(u, a, p))
                 ^
999.           goto err;
1000.   

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:1006:18: Call
1004.               goto err;
1005.           if (BN_is_bit_set(b, i)) {
1006.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                         ^
1007.                   goto err;
1008.           }

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 `a->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 `*a->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:519:44: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
  517.           for (i = 0; i < a->top; i += 2) {
  518.               x0 = a->d[i];
  519.               x1 = ((i + 1) == a->top) ? 0 : a->d[i + 1];
                                                    ^
  520.               bn_GF2m_mul_2x2(zz, x1, x0, y1, y0);
  521.               for (k = 0; k < 4; k++)
