crypto/rsa/rsa_chk.c:66: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul`.
Showing all 16 steps of the trace


crypto/rsa/rsa_chk.c:60:9: Call
58.   
59.       /* q prime? */
60.       if (BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb) != 1) {
              ^
61.           ret = 0;
62.           RSAerr(RSA_F_RSA_CHECK_KEY_EX, RSA_R_Q_NOT_PRIME);

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:286:13: Call
    284.           /* now 1 <= check < A */
    285.   
    286.           j = witness(check, A, A1, A1_odd, k, ctx, mont);
                       ^
    287.           if (j == -1)
    288.               goto err;

crypto/bn/bn_prime.c:389:10: Call
      387.                      BN_MONT_CTX *mont)
      388.   {
      389.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      390.           return -1;
      391.       if (BN_is_one(w))

crypto/bn/bn_exp.c:357:14: Call
        355.   
        356.       if (a->neg || BN_ucmp(a, m) >= 0) {
        357.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        358.               goto err;
        359.           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:140:1: Parameter `*dv->d`
            138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            139.    */
            140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            141.              BN_CTX *ctx)
            142.   {

crypto/rsa/rsa_chk.c:66:10: Call
64.   
65.       /* n = p*q? */
66.       if (!BN_mul(i, key->p, key->q, ctx)) {
               ^
67.           ret = -1;
68.           goto err;

crypto/bn/bn_mul.c:878:13: Assignment
  876.               if (bn_wexpand(rr, 16) == NULL)
  877.                   goto err;
  878.               rr->top = 16;
                     ^
  879.               bn_mul_comba8(rr->d, a->d, b->d);
  880.               goto end;

crypto/bn/bn_mul.c:972:5: Call
  970.   #endif
  971.       rr->neg = a->neg ^ b->neg;
  972.       bn_correct_top(rr);
             ^
  973.       if (r != rr && BN_copy(r, rr) == NULL)
  974.           goto err;

crypto/bn/bn_lib.c:1021:1: <Offset trace>
1019.   }
1020.   
1021. > void bn_correct_top(BIGNUM *a)
1022.   {
1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1021:1: Parameter `a->top`
    1019.   }
    1020.   
    1021. > void bn_correct_top(BIGNUM *a)
    1022.   {
    1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1024:5: Assignment
    1022.   {
    1023.       BN_ULONG *ftl;
    1024.       int tmp_top = a->top;
                ^
    1025.   
    1026.       if (tmp_top > 0) {

crypto/bn/bn_lib.c:1021:1: <Length trace>
1019.   }
1020.   
1021. > void bn_correct_top(BIGNUM *a)
1022.   {
1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1021:1: Parameter `*a->d`
    1019.   }
    1020.   
    1021. > void bn_correct_top(BIGNUM *a)
    1022.   {
    1023.       BN_ULONG *ftl;

crypto/bn/bn_lib.c:1027:14: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mul` 
    1025.   
    1026.       if (tmp_top > 0) {
    1027.           for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
                         ^
    1028.               ftl--;
    1029.               if (*ftl != 0)
