crypto/bn/bn_exp.c:1439: error: BUFFER_OVERRUN_L3
  Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 15 steps of the trace


crypto/bn/bn_exp.c:1366:9: Call
1364.   
1365.       BN_CTX_start(ctx);
1366.       d = BN_CTX_get(ctx);
                ^
1367.       val[0] = BN_CTX_get(ctx);
1368.       if (!d || !val[0])

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/bn/bn_exp.c:1439:14: Call
1437.   
1438.           /* wvalue will be an odd number < 2^window */
1439.           if (!BN_mod_mul(r, r, val[wvalue >> 1], m, ctx))
                     ^
1440.               goto err;
1441.   

crypto/bn/bn_mod.c:178:1: Parameter `*b->d`
  176.   
  177.   /* slow but works */
  178. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  179.                  BN_CTX *ctx)
  180.   {

crypto/bn/bn_mod.c:195:14: Call
  193.               goto err;
  194.       } else {
  195.           if (!BN_mul(t, a, b, ctx))
                      ^
  196.               goto err;
  197.       }

crypto/bn/bn_mul.c:882:1: Parameter `*b->d`
    880.   #endif                          /* BN_RECURSION */
    881.   
    882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    883.   {
    884.       int ret = 0;

crypto/bn/bn_mul.c:963:17: Call
    961.                   if (bn_wexpand(rr, k * 4) == NULL)
    962.                       goto err;
    963.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    964.                                         j, al - j, bl - j, t->d);
    965.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:533:1: Parameter `*b`
      531.    */
      532.   /* tnX may not be negative but less than n */
      533. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      534.                              int tna, int tnb, BN_ULONG *t)
      535.   {

crypto/bn/bn_mul.c:541:9: Call
      539.   
      540.       if (n < 8) {
      541.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      542.           return;
      543.       }

crypto/bn/bn_mul.c:1036:1: <Length trace>
1034.   }
1035.   
1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1037.   {
1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1036:1: Parameter `*b`
        1034.   }
        1035.   
        1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        1037.   {
        1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1057:40: Array access: Offset: 0 Size: [0, 8388607] by call to `BN_mod_mul` 
        1055.           return;
        1056.       } else
        1057.           rr[0] = bn_mul_words(r, a, na, b[0]);
                                                       ^
        1058.   
        1059.       for (;;) {
