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


crypto/bn/bn_recp.c:63:14: Call
61.   
62.       BN_CTX_start(ctx);
63.       if ((a = BN_CTX_get(ctx)) == NULL)
                   ^
64.           goto err;
65.       if (y != NULL) {

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_recp.c:70:18: Call
68.                   goto err;
69.           } else {
70.               if (!BN_mul(a, x, y, ctx))
                       ^
71.                   goto err;
72.           }

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 = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
  497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                       ^
  500.   
  501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `*r->d`
    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:585:21: Call
    583.                   if (bn_wexpand(t, k * 4) == NULL)
    584.                       goto err;
    585.                   if (bn_wexpand(rr, k * 4) == NULL)
                               ^
    586.                       goto err;
    587.                   bn_mul_part_recursive(rr->d, a->d, b->d,

crypto/bn/bn_lib.c:948:1: Parameter `*a->d`
      946.   }
      947.   
      948. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      949.   {
      950.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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 `*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:622:1: <Length trace>
620.   }
621.   
622. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
623.   {
624.       BN_ULONG *rr;

crypto/bn/bn_mul.c:622:1: Parameter `*b`
          620.   }
          621.   
          622. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
          623.   {
          624.       BN_ULONG *rr;

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