crypto/rsa/rsa_chk.c:128: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 26 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/rsa/rsa_chk.c:128:10: Call
126.   
127.       /* now compute k = \lambda(n) = LCM(i, j, r_3 - 1...) */
128.       if (!BN_mul(l, i, j, ctx)) {
                ^
129.           ret = -1;
130.           goto err;

crypto/bn/bn_mul.c:497:1: Parameter `*b->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 `*b->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 `n`
      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:336:10: Call
      334.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      335.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      336.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      337.       neg = 0;
      338.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:743:1: Parameter `cl`
        741.    */
        742.   
        743. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        744.   {
        745.       int n, i;

crypto/bn/bn_lib.c:760:12: Call
        758.           }
        759.       }
        760.       return bn_cmp_words(a, b, cl);
                          ^
        761.   }
        762.   

crypto/bn/bn_lib.c:713:1: <Offset trace>
711.   }
712.   
713. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
714.   {
715.       int i;

crypto/bn/bn_lib.c:713:1: Parameter `n`
          711.   }
          712.   
          713. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          714.   {
          715.       int i;

crypto/bn/bn_lib.c:725:10: Assignment
          723.       if (aa != bb)
          724.           return ((aa > bb) ? 1 : -1);
          725.       for (i = n - 2; i >= 0; i--) {
                          ^
          726.           aa = a[i];
          727.           bb = b[i];

crypto/bn/bn_lib.c:713:1: <Length trace>
711.   }
712.   
713. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
714.   {
715.       int i;

crypto/bn/bn_lib.c:713:1: Parameter `*a`
          711.   }
          712.   
          713. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          714.   {
          715.       int i;

crypto/bn/bn_lib.c:726:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
          724.           return ((aa > bb) ? 1 : -1);
          725.       for (i = n - 2; i >= 0; i--) {
          726.           aa = a[i];
                              ^
          727.           bb = b[i];
          728.           if (aa != bb)
