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


crypto/bn/bn_gf2m.c:1127:9: Call
1125.   
1126.       BN_CTX_start(ctx);
1127.       a = BN_CTX_get(ctx);
                ^
1128.       z = BN_CTX_get(ctx);
1129.       w = BN_CTX_get(ctx);

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

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

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

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

crypto/bn/bn_gf2m.c:381:9: Call
  379.       if (!p[0]) {
  380.           /* reduction mod 1 => return 0 */
  381.           BN_zero(r);
                 ^
  382.           return 1;
  383.       }

crypto/bn/bn_lib.c:530:1: <Length trace>
528.   }
529.   
530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
531.   {
532.       bn_check_top(a);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_lib.c:536:5: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_arr` 
    534.           return (0);
    535.       a->neg = 0;
    536.       a->d[0] = w;
               ^
    537.       a->top = (w ? 1 : 0);
    538.       bn_check_top(a);
