crypto/rsa/rsa_x931g.c:60: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_X931_derive_prime_ex`.
Showing all 18 steps of the trace


crypto/rsa/rsa_x931g.c:44:18: Call
42.           goto err;
43.       if (!rsa->e) {
44.           rsa->e = BN_dup(e);
                       ^
45.           if (!rsa->e)
46.               goto err;

crypto/bn/bn_lib.c:354:10: Call
  352.       if (t == NULL)
  353.           return NULL;
  354.       if (!BN_copy(t, a)) {
                  ^
  355.           BN_free(t);
  356.           return NULL;

crypto/bn/bn_lib.c:362:1: Parameter `*a->d`
    360.   }
    361.   
    362. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    363.   {
    364.       int i;

crypto/rsa/rsa_x931g.c:60:14: Call
58.               goto err;
59.   
60.           if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,
                   ^
61.                                        Xp, Xp1, Xp2, e, ctx, cb))
62.               goto err;

crypto/bn/bn_x931p.c:51:1: Parameter `*p->d`
  49.    */
  50.   
  51. > int BN_X931_derive_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
  52.                               const BIGNUM *Xp, const BIGNUM *Xp1,
  53.                               const BIGNUM *Xp2, const BIGNUM *e, BN_CTX *ctx,

crypto/bn/bn_x931p.c:91:10: Call
  89.       /* First set p to value of Rp */
  90.   
  91.       if (!BN_mod_inverse(p, p2, p1, ctx))
                 ^
  92.           goto err;
  93.   

crypto/bn/bn_gcd.c:124:1: Parameter `*in->d`
    122.                                           BN_CTX *ctx);
    123.   
    124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
    125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
    126.   {

crypto/bn/bn_gcd.c:129:10: Call
    127.       BIGNUM *rv;
    128.       int noinv;
    129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                    ^
    130.       if (noinv)
    131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `*in->d`
      133.   }
      134.   
      135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
      136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
      137.                              int *pnoinv)

crypto/bn/bn_x931p.c:94:10: Call
  92.           goto err;
  93.   
  94.       if (!BN_mul(p, p, p2, ctx))
                 ^
  95.           goto err;
  96.   

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_X931_derive_prime_ex` 
      1025.   
      1026.       if (tmp_top > 0) {
      1027.           for (ftl = &(a->d[tmp_top]); tmp_top > 0; tmp_top--) {
                           ^
      1028.               ftl--;
      1029.               if (*ftl != 0)
