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


crypto/bn/bn_gf2m.c:867:14: Call
865.   
866.       BN_CTX_start(ctx);
867.       if ((u = BN_CTX_get(ctx)) == NULL)
                    ^
868.           goto err;
869.   

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:358:1: Parameter `*a->d`
    356.   }
    357.   
    358. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    359.   {
    360.       bn_check_top(a);

crypto/bn/bn_lib.c:361:9: Call
    359.   {
    360.       bn_check_top(a);
    361.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    362.           return 0;
    363.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_gf2m.c:878:18: Call
876.               goto err;
877.           if (BN_is_bit_set(b, i)) {
878.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                        ^
879.                   goto err;
880.           }

crypto/bn/bn_gf2m.c:410:1: Parameter `*r->d`
  408.    * the result in r.  r could be a or b; a could be b.
  409.    */
  410. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  411.                           const int p[], BN_CTX *ctx)
  412.   {

crypto/bn/bn_gf2m.c:421:16: Call
  419.   
  420.       if (a == b) {
  421.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  422.       }
  423.   

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

crypto/bn/bn_gf2m.c:509:10: Call
    507.       s->top = 2 * a->top;
    508.       bn_correct_top(s);
    509.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    510.           goto err;
    511.       bn_check_top(r);

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

crypto/bn/bn_gf2m.c:302:9: Call
      300.       if (!p[0]) {
      301.           /* reduction mod 1 => return 0 */
      302.           BN_zero(r);
                     ^
      303.           return 1;
      304.       }

crypto/bn/bn_lib.c:358:1: <Length trace>
356.   }
357.   
358. > int BN_set_word(BIGNUM *a, BN_ULONG w)
359.   {
360.       bn_check_top(a);

crypto/bn/bn_lib.c:358:1: Parameter `*a->d`
        356.   }
        357.   
        358. > int BN_set_word(BIGNUM *a, BN_ULONG w)
        359.   {
        360.       bn_check_top(a);

crypto/bn/bn_lib.c:361:9: Call
        359.   {
        360.       bn_check_top(a);
        361.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                       ^
        362.           return 0;
        363.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
          658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
          659.   
          660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
          661.   {
          662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_lib.c:364:5: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_GF2m_mod_mul_arr` 
        362.           return 0;
        363.       a->neg = 0;
        364.       a->d[0] = w;
                   ^
        365.       a->top = (w ? 1 : 0);
        366.       a->flags &= ~BN_FLG_FIXED_TOP;
