test/bntest.c:932: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 14 steps of the trace


test/bntest.c:929:5: Call
927.       e = BN_new();
928.   
929.       BN_one(a);
           ^
930.       BN_one(b);
931.       BN_zero(c);

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))

test/bntest.c:932:9: Call
930.       BN_one(b);
931.       BN_zero(c);
932.       if (BN_mod_mul(e, a, b, c, ctx)) {
               ^
933.           fprintf(stderr, "BN_mod_mul with zero modulus succeeded!\n");
934.           return 0;

crypto/bn/bn_mod.c:73:1: Parameter `*b->d`
  71.   
  72.   /* slow but works */
  73. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  74.                  BN_CTX *ctx)
  75.   {

crypto/bn/bn_mod.c:90:14: Call
  88.               goto err;
  89.       } else {
  90.           if (!BN_mul(t, a, b, ctx))
                     ^
  91.               goto err;
  92.       }

crypto/bn/bn_mul.c:828:1: Parameter `*b->d`
    826.   #endif                          /* BN_RECURSION */
    827.   
    828. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    829.   {
    830.       int ret = 0;

crypto/bn/bn_mul.c:909:17: Call
    907.                   if (bn_wexpand(rr, k * 4) == NULL)
    908.                       goto err;
    909.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                           ^
    910.                                         j, al - j, bl - j, t->d);
    911.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:480:1: Parameter `*b`
      478.    */
      479.   /* tnX may not be negative but less than n */
      480. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
      481.                              int tna, int tnb, BN_ULONG *t)
      482.   {

crypto/bn/bn_mul.c:488:9: Call
      486.   
      487.       if (n < 8) {
      488.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      489.           return;
      490.       }

crypto/bn/bn_mul.c:983:1: <Length trace>
981.   }
982.   
983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
984.   {
985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:983:1: Parameter `*b`
        981.   }
        982.   
        983. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        984.   {
        985.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1018:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul` 
        1016.           if (--nb <= 0)
        1017.               return;
        1018.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1019.           rr += 4;
        1020.           r += 4;
