crypto/bn/bn_mod.c:90: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul`.
Showing all 17 steps of the trace


crypto/bn/bn_mod.c:84:14: Call
82.   
83.       BN_CTX_start(ctx);
84.       if ((t = BN_CTX_get(ctx)) == NULL)
                   ^
85.           goto err;
86.       if (a == b) {

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:387:1: Parameter `*a->d`
    385.   }
    386.   
    387. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    388.   {
    389.       bn_check_top(a);

crypto/bn/bn_lib.c:390:9: Call
    388.   {
    389.       bn_check_top(a);
    390.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    391.           return 0;
    392.       a->neg = 0;

crypto/bn/bn_lcl.h:651:1: Parameter `*a->d`
      649.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      650.   
      651. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      652.   {
      653.       if (bits > (INT_MAX - BN_BITS2 + 1))

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:497:1: Parameter `*r->d`
  495.   #endif                          /* BN_RECURSION */
  496.   
  497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = 0;

crypto/bn/bn_mul.c:575:21: Call
  573.                   if (bn_wexpand(t, k * 4) == NULL)
  574.                       goto err;
  575.                   if (bn_wexpand(rr, k * 4) == NULL)
                             ^
  576.                       goto err;
  577.                   bn_mul_part_recursive(rr->d, a->d, b->d,

crypto/bn/bn_lib.c:940:1: Parameter `*a->d`
    938.   }
    939.   
    940. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
    941.   {
    942.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_mul.c:577:17: Call
  575.                   if (bn_wexpand(rr, k * 4) == NULL)
  576.                       goto err;
  577.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  578.                                         j, al - j, bl - j, t->d);
  579.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `*t`
    320.    */
    321.   /* tnX may not be negative but less than n */
    322. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    323.                              int tna, int tnb, BN_ULONG *t)
    324.   {

crypto/bn/bn_mul.c:382:9: Call
    380.       } else {
    381.           p = &(t[n2 * 2]);
    382.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    383.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    384.           i = n / 2;

crypto/bn/bn_mul.c:175:1: Parameter `*a`
      173.    */
      174.   /* dnX may not be positive, but n2/2+dnX has to be */
      175. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      176.                         int dna, int dnb, BN_ULONG *t)
      177.   {

crypto/bn/bn_mul.c:201:9: Call
      199.       /* Else do normal multiply */
      200.       if (n2 < BN_MUL_RECURSIVE_SIZE_NORMAL) {
      201.           bn_mul_normal(r, a, n2 + dna, b, n2 + dnb);
                     ^
      202.           if ((dna + dnb) < 0)
      203.               memset(&r[2 * n2 + dna + dnb], 0,

crypto/bn/bn_mul.c:612:1: <Length trace>
610.   }
611.   
612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
613.   {
614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:612:1: Parameter `*b`
        610.   }
        611.   
        612. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        613.   {
        614.       BN_ULONG *rr;

crypto/bn/bn_mul.c:647:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul` 
        645.           if (--nb <= 0)
        646.               return;
        647.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                ^
        648.           rr += 4;
        649.           r += 4;
