crypto/rsa/rsa_chk.c:97: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mul`.
Showing all 21 steps of the trace


crypto/rsa/rsa_chk.c:82:9: Call
80.   
81.       /* q prime? */
82.       if (BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb) != 1) {
              ^
83.           ret = 0;
84.           RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_Q_NOT_PRIME);

crypto/bn/bn_prime.c:182:12: Call
  180.                      BN_GENCB *cb)
  181.   {
  182.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  183.   }
  184.   

crypto/bn/bn_prime.c:223:11: Call
    221.           goto err;
    222.   
    223.       ret = bn_miller_rabin_is_prime(w, checks, ctx, cb, 0, &status);
                     ^
    224.       if (!ret)
    225.           goto err;

crypto/bn/bn_prime.c:315:14: Call
      313.           }
      314.           /* (Step 4.5) z = b^m mod w */
      315.           if (!BN_mod_exp_mont(z, b, m, w, ctx, mont))
                          ^
      316.               goto err;
      317.           /* (Step 4.6) if (z = 1 or z = w-1) */

crypto/bn/bn_exp.c:354:14: Call
        352.   
        353.       if (a->neg || BN_ucmp(a, m) >= 0) {
        354.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        355.               goto err;
        356.           aa = val[0];

crypto/bn/bn_mod.c:20:11: Call
          18.        */
          19.   
          20.       if (!(BN_mod(r, m, d, ctx)))
                          ^
          21.           return 0;
          22.       if (!r->neg)

crypto/bn/bn_div.c:209:1: Parameter `*dv->d`
            207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            208.    */
            209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            210.              BN_CTX *ctx)
            211.   {

crypto/rsa/rsa_chk.c:97:10: Call
95.   
96.       /* n = p*q * r_3...r_i? */
97.       if (!BN_mul(i, key->p, key->q, ctx)) {
                ^
98.           ret = -1;
99.           goto err;

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:962:1: Parameter `*a->d`
      960.   }
      961.   
      962. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      963.   {
      964.       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;
