crypto/bn/bn_sqrt.c:147: 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:109:9: Call
107.   
108.       BN_CTX_start(ctx);
109.       A = BN_CTX_get(ctx);
               ^
110.       b = BN_CTX_get(ctx);
111.       q = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_sqrt.c:147:14: Call
145.           if (!BN_add_word(q, 1))
146.               goto end;
147.           if (!BN_mod_exp(ret, A, q, p, ctx))
                    ^
148.               goto end;
149.           err = 0;

crypto/bn/bn_exp.c:190:1: Parameter `*a->d`
  188.   }
  189.   
  190. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
  191.                  BN_CTX *ctx)
  192.   {

crypto/bn/bn_exp.c:250:19: Call
  248.           } else
  249.   # endif
  250.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  251.       } else
  252.   #endif

crypto/bn/bn_exp.c:400:1: Parameter `*a->d`
    398.   }
    399.   
    400. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    401.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    402.   {

crypto/bn/bn_exp.c:412:16: Call
    410.   
    411.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
    412.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                          ^
    413.       }
    414.   

crypto/bn/bn_exp.c:654:1: Parameter `*a->d`
      652.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
      653.    */
      654. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      655.                                 const BIGNUM *m, BN_CTX *ctx,
      656.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:811:17: Call
      809.           if (!BN_to_montgomery(&am, &am, mont, ctx))
      810.               goto err;
      811.       } else if (!BN_to_montgomery(&am, a, mont, ctx))
                             ^
      812.           goto err;
      813.   

crypto/bn/bn_lib.c:1000:1: Parameter `*a->d`
        998.   }
        999.   
        1000. > int BN_to_montgomery(BIGNUM *r, const BIGNUM *a, BN_MONT_CTX *mont,
        1001.                        BN_CTX *ctx)
        1002.   {

crypto/bn/bn_lib.c:1003:12: Call
        1001.                        BN_CTX *ctx)
        1002.   {
        1003.       return BN_mod_mul_montgomery(r, a, &(mont->RR), mont, ctx);
                           ^
        1004.   }
        1005.   

crypto/bn/bn_mont.c:127:1: Parameter `*a->d`
          125.   #endif
          126.   
          127. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
          128.                             BN_MONT_CTX *mont, BN_CTX *ctx)
          129.   {

crypto/bn/bn_mont.c:157:14: Call
          155.               goto err;
          156.       } else {
          157.           if (!BN_mul(tmp, a, b, ctx))
                              ^
          158.               goto err;
          159.       }

crypto/bn/bn_mul.c:882:1: Parameter `*a->d`
            880.   #endif                          /* BN_RECURSION */
            881.   
            882. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
            883.   {
            884.       int ret = 0;

crypto/bn/bn_mul.c:963:17: Call
            961.                   if (bn_wexpand(rr, k * 4) == NULL)
            962.                       goto err;
            963.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                                   ^
            964.                                         j, al - j, bl - j, t->d);
            965.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:533:1: Parameter `*a`
              531.    */
              532.   /* tnX may not be negative but less than n */
              533. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
              534.                              int tna, int tnb, BN_ULONG *t)
              535.   {

crypto/bn/bn_mul.c:541:9: Call
              539.   
              540.       if (n < 8) {
              541.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                             ^
              542.           return;
              543.       }

crypto/bn/bn_mul.c:1036:1: <Length trace>
1034.   }
1035.   
1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1037.   {
1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1036:1: Parameter `*b`
                1034.   }
                1035.   
                1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
                1037.   {
                1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1071:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_exp` 
                1069.           if (--nb <= 0)
                1070.               return;
                1071.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                         ^
                1072.           rr += 4;
                1073.           r += 4;
