crypto/bn/bn_mont.c:70: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `bn_mul_fixed_top`.
Showing all 21 steps of the trace


crypto/bn/bn_mont.c:61:11: Call
59.   
60.       BN_CTX_start(ctx);
61.       tmp = BN_CTX_get(ctx);
                ^
62.       if (tmp == NULL)
63.           goto err;

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

crypto/bn/bn_lib.c:362:9: Call
    360.   {
    361.       bn_check_top(a);
    362.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    363.           return 0;
    364.       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_mont.c:70:14: Call
68.               goto err;
69.       } else {
70.           if (!bn_mul_fixed_top(tmp, a, b, ctx))
                   ^
71.               goto err;
72.       }

crypto/bn/bn_mul.c:507:1: Parameter `a->top`
  505.   }
  506.   
  507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  508.   {
  509.       int ret = 0;

crypto/bn/bn_mul.c:524:5: Assignment
  522.       bn_check_top(r);
  523.   
  524.       al = a->top;
             ^
  525.       bl = b->top;
  526.   

crypto/bn/bn_mul.c:587:17: Call
  585.                   if (bn_wexpand(rr, k * 4) == NULL)
  586.                       goto err;
  587.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  588.                                         j, al - j, bl - j, t->d);
  589.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:322:1: Parameter `n`
    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 `*b`
      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:209:10: Call
      207.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      208.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      209.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      210.       zero = neg = 0;
      211.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:706:1: Parameter `cl`
        704.    */
        705.   
        706. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        707.   {
        708.       int n, i;

crypto/bn/bn_lib.c:723:12: Call
        721.           }
        722.       }
        723.       return bn_cmp_words(a, b, cl);
                          ^
        724.   }
        725.   

crypto/bn/bn_lib.c:679:1: <Offset trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `n`
          677.   }
          678.   
          679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          680.   {
          681.       int i;

crypto/bn/bn_lib.c:688:10: Assignment
          686.       if (aa != bb)
          687.           return ((aa > bb) ? 1 : -1);
          688.       for (i = n - 2; i >= 0; i--) {
                          ^
          689.           aa = a[i];
          690.           bb = b[i];

crypto/bn/bn_lib.c:679:1: <Length trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `*b`
          677.   }
          678.   
          679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          680.   {
          681.       int i;

crypto/bn/bn_lib.c:690:14: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `bn_mul_fixed_top` 
          688.       for (i = n - 2; i >= 0; i--) {
          689.           aa = a[i];
          690.           bb = b[i];
                              ^
          691.           if (aa != bb)
          692.               return ((aa > bb) ? 1 : -1);
