crypto/bn/bn_sqrt.c:98: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 21 steps of the trace


crypto/bn/bn_sqrt.c:60:9: Call
58.   
59.       BN_CTX_start(ctx);
60.       A = BN_CTX_get(ctx);
              ^
61.       b = BN_CTX_get(ctx);
62.       q = BN_CTX_get(ctx);

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

crypto/bn/bn_lib.c:360:9: Call
    358.   {
    359.       bn_check_top(a);
    360.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    361.           return 0;
    362.       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_sqrt.c:98:14: Call
96.           if (!BN_add_word(q, 1))
97.               goto end;
98.           if (!BN_mod_exp(ret, A, q, p, ctx))
                    ^
99.               goto end;
100.           err = 0;

crypto/bn/bn_exp.c:89:1: Parameter `*a->d`
  87.   }
  88.   
  89. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  90.                  BN_CTX *ctx)
  91.   {

crypto/bn/bn_exp.c:144:19: Call
  142.           } else
  143.   # endif
  144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  145.       } else
  146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `*a->d`
    294.   }
    295.   
    296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    298.   {

crypto/bn/bn_exp.c:364:10: Call
    362.           goto err;
    363.       }
    364.       if (!BN_to_montgomery(val[0], aa, mont, ctx))
                    ^
    365.           goto err;               /* 1 */
    366.   

crypto/bn/bn_lib.c:839:1: Parameter `*a->d`
      837.   }
      838.   
      839. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
      840.                        BN_CTX *ctx)
      841.   {

crypto/bn/bn_lib.c:842:12: Call
      840.                        BN_CTX *ctx)
      841.   {
      842.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                        ^
      843.   }
      844.   

crypto/bn/bn_mont.c:26:1: Parameter `*a->d`
        24.   #endif
        25.   
        26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
        27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
        28.   {

crypto/bn/bn_mont.c:56:14: Call
        54.               goto err;
        55.       } else {
        56.           if (!BN_mul(tmp, a, b, ctx))
                           ^
        57.               goto err;
        58.       }

crypto/bn/bn_mul.c:497:1: Parameter `*a->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: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 `*a`
            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:330:9: Call
            328.   
            329.       if (n < 8) {
            330.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                           ^
            331.           return;
            332.       }

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_mod_exp` 
              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;
