crypto/bn/bn_gf2m.c:1006: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr`.
Showing all 12 steps of the trace


crypto/bn/bn_gf2m.c:995:14: Call
993.   
994.       BN_CTX_start(ctx);
995.       if ((u = BN_CTX_get(ctx)) == NULL)
                    ^
996.           goto err;
997.   

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

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: Parameter `*r->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:499:16: Call
  497.   
  498.       if (a == b) {
  499.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  500.       }
  501.   

crypto/bn/bn_gf2m.c:567:1: Parameter `*r->d`
    565.   
    566.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    567. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
    568.                           BN_CTX *ctx)
    569.   {

crypto/bn/bn_gf2m.c:587:10: Call
    585.       s->top = 2 * a->top;
    586.       bn_correct_top(s);
    587.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    588.           goto err;
    589.       bn_check_top(r);

crypto/bn/bn_gf2m.c:370:1: <Length trace>
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:370:1: Parameter `*r->d`
      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:396:5: Assignment
      394.           r->top = a->top;
      395.       }
      396.       z = r->d;
                 ^
      397.   
      398.       /* start reduction */

crypto/bn/bn_gf2m.c:442:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
      440.           else
      441.               z[dN] = 0;
      442.           z[0] ^= zz;             /* reduction t^0 component */
                     ^
      443.   
      444.           for (k = 1; p[k] != 0; k++) {
