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 23 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: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_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:310:16: Call
    308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
    309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
    310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    311.       }
    312.   

crypto/bn/bn_exp.c:592:1: Parameter `*a->d`
      590.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      591.    */
      592. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      593.                                 const BIGNUM *m, BN_CTX *ctx,
      594.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:757:10: Call
      755.   
      756.       /* prepare a^1 in Montgomery domain */
      757.       if (!bn_to_mont_fixed_top(&am, a, mont, ctx))
                      ^
      758.           goto err;
      759.   

crypto/bn/bn_mont.c:222:1: Parameter `*a->d`
        220.   }
        221.   
        222. > int bn_to_mont_fixed_top(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        223.                            BN_CTX *ctx)
        224.   {

crypto/bn/bn_mont.c:225:12: Call
        223.                            BN_CTX *ctx)
        224.   {
        225.       return bn_mul_mont_fixed_top(r, a, &(mont->RR), mont, ctx);
                          ^
        226.   }
        227.   

crypto/bn/bn_mont.c:37:1: Parameter `*a->d`
          35.   }
          36.   
          37. > int bn_mul_mont_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
          38.                             BN_MONT_CTX *mont, BN_CTX *ctx)
          39.   {

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