crypto/ec/ec2_mult.c:261: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_arr`.
Showing all 10 steps of the trace


crypto/ec/ec2_mult.c:248:10: Call
246.        */
247.       BN_CTX_start(ctx);
248.       x1 = BN_CTX_get(ctx);
                ^
249.       z1 = BN_CTX_get(ctx);
250.       if (z1 == NULL)

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:463:1: Parameter `*a->d`
    461.   }
    462.   
    463. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    464.   {
    465.       bn_check_top(a);

crypto/bn/bn_lib.c:466:9: Call
    464.   {
    465.       bn_check_top(a);
    466.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    467.           return (0);
    468.       a->neg = 0;

crypto/bn/bn_lcl.h:676:1: Parameter `*a->d`
      674.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      675.   
      676. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      677.   {
      678.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/ec/ec2_mult.c:261:10: Call
259.       bn_wexpand(z2, bn_get_top(group->field));
260.   
261.       if (!BN_GF2m_mod_arr(x1, point->X, group->poly))
                ^
262.           goto err;               /* x1 = x */
263.       if (!BN_one(z1))

crypto/bn/bn_gf2m.c:300:1: <Length trace>
298.   
299.   /* Performs modular reduction of a and store result in r.  r could be a. */
300. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
301.   {
302.       int j, k;

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

crypto/bn/bn_gf2m.c:326:5: Assignment
  324.           r->top = a->top;
  325.       }
  326.       z = r->d;
             ^
  327.   
  328.       /* start reduction */

crypto/bn/bn_gf2m.c:372:9: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_arr` 
  370.           else
  371.               z[dN] = 0;
  372.           z[0] ^= zz;             /* reduction t^0 component */
                 ^
  373.   
  374.           for (k = 1; p[k] != 0; k++) {
