crypto/ec/ec2_oct.c:119: 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_oct.c:112:11: Call
110.   
111.       BN_CTX_start(ctx);
112.       tmp = BN_CTX_get(ctx);
                 ^
113.       x = BN_CTX_get(ctx);
114.       y = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:275:5: Call
  273.       }
  274.       /* OK, make sure the returned bignum is "zero" */
  275.       BN_zero(ret);
             ^
  276.       ctx->used++;
  277.       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_lib.c:523:9: Call
    521.   {
    522.       bn_check_top(a);
    523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    524.           return (0);
    525.       a->neg = 0;

crypto/bn/bn_lcl.h:777:1: Parameter `*a->d`
      775.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      776.   
      777. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      778.   {
      779.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/ec/ec2_oct.c:119:10: Call
117.           goto err;
118.   
119.       if (!BN_GF2m_mod_arr(x, x_, group->poly))
                ^
120.           goto err;
121.       if (BN_is_zero(x)) {

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_arr` 
  440.           else
  441.               z[dN] = 0;
  442.           z[0] ^= zz;             /* reduction t^0 component */
                 ^
  443.   
  444.           for (k = 1; p[k] != 0; k++) {
