crypto/rsa/rsa_x931g.c:61: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_derive_prime_ex`.
Showing all 24 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:273:10: Call
  271.       if (t == NULL)
  272.           return NULL;
  273.       if (!BN_copy(t, a)) {
                  ^
  274.           BN_free(t);
  275.           return NULL;

crypto/bn/bn_lib.c:281:1: Parameter `*a->d`
    279.   }
    280.   
    281. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
    282.   {
    283.       bn_check_top(b);

crypto/rsa/rsa_x931g.c:61:14: Call
59.               goto err;
60.   
61.           if (!BN_X931_derive_prime_ex(rsa->p, p1, p2,
                   ^
62.                                        Xp, Xp1, Xp2, e, ctx, cb))
63.               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:497:1: Parameter `*a->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 `*a->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:335:10: Call
        333.   
        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;

crypto/bn/bn_lib.c:706:1: Parameter `cl`
          704.    */
          705.   
          706. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
          707.   {
          708.       int n, i;

crypto/bn/bn_lib.c:723:12: Call
          721.           }
          722.       }
          723.       return bn_cmp_words(a, b, cl);
                            ^
          724.   }
          725.   

crypto/bn/bn_lib.c:679:1: <Offset trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `n`
            677.   }
            678.   
            679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
            680.   {
            681.       int i;

crypto/bn/bn_lib.c:688:10: Assignment
            686.       if (aa != bb)
            687.           return ((aa > bb) ? 1 : -1);
            688.       for (i = n - 2; i >= 0; i--) {
                            ^
            689.           aa = a[i];
            690.           bb = b[i];

crypto/bn/bn_lib.c:679:1: <Length trace>
677.   }
678.   
679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
680.   {
681.       int i;

crypto/bn/bn_lib.c:679:1: Parameter `*b`
            677.   }
            678.   
            679. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
            680.   {
            681.       int i;

crypto/bn/bn_lib.c:690:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_derive_prime_ex` 
            688.       for (i = n - 2; i >= 0; i--) {
            689.           aa = a[i];
            690.           bb = b[i];
                                ^
            691.           if (aa != bb)
            692.               return ((aa > bb) ? 1 : -1);
