crypto/rsa/rsa_x931g.c:170: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_generate_prime_ex`.
Showing all 38 steps of the trace


crypto/rsa/rsa_x931g.c:156:10: Call
154.   
155.       BN_CTX_start(ctx);
156.       Xp = BN_CTX_get(ctx);
                ^
157.       Xq = BN_CTX_get(ctx);
158.       if (Xq == NULL)

crypto/bn/bn_ctx.c:240:5: Call
  238.       }
  239.       /* OK, make sure the returned bignum is "zero" */
  240.       BN_zero(ret);
             ^
  241.       /* clear BN_FLG_CONSTTIME if leaked from previous frames */
  242.       ret->flags &= (~BN_FLG_CONSTTIME);

crypto/bn/bn_lib.c:361:1: Parameter `*a->d`
    359.   }
    360.   
    361. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    362.   {
    363.       bn_check_top(a);

crypto/bn/bn_lib.c:364:9: Call
    362.   {
    363.       bn_check_top(a);
    364.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    365.           return 0;
    366.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/rsa/rsa_x931g.c:160:10: Call
158.       if (Xq == NULL)
159.           goto error;
160.       if (!BN_X931_generate_Xpq(Xp, Xq, bits, ctx))
                ^
161.           goto error;
162.   

crypto/bn/bn_x931p.c:160:1: Parameter `*Xp->d`
  158.    */
  159.   
  160. > int BN_X931_generate_Xpq(BIGNUM *Xp, BIGNUM *Xq, int nbits, BN_CTX *ctx)
  161.   {
  162.       BIGNUM *t;

crypto/bn/bn_x931p.c:176:10: Call
  174.        * exceeded.
  175.        */
  176.       if (!BN_priv_rand(Xp, nbits, BN_RAND_TOP_TWO, BN_RAND_BOTTOM_ANY))
                  ^
  177.           goto err;
  178.   

crypto/bn/bn_rand.c:121:1: Parameter `*rnd->d`
    119.   }
    120.   
    121. > int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);

crypto/bn/bn_rand.c:123:12: Call
    121.   int BN_priv_rand(BIGNUM *rnd, int bits, int top, int bottom)
    122.   {
    123.       return bnrand(PRIVATE, rnd, bits, top, bottom, NULL);
                      ^
    124.   }
    125.   

crypto/bn/bn_rand.c:23:1: Parameter `*rnd->d`
      21.   } BNRAND_FLAG;
      22.   
      23. > static int bnrand(BNRAND_FLAG flag, BIGNUM *rnd, int bits, int top, int bottom,
      24.                     BN_CTX *ctx)
      25.   {

crypto/bn/bn_rand.c:89:10: Call
      87.       if (bottom)                 /* set bottom bit if requested */
      88.           buf[bytes - 1] |= 1;
      89.       if (!BN_bin2bn(buf, bytes, rnd))
                     ^
      90.           goto err;
      91.       ret = 1;

crypto/bn/bn_lib.c:374:1: Parameter `*ret->d`
        372.   }
        373.   
        374. > BIGNUM *BN_bin2bn(const unsigned char *s, int len, BIGNUM *ret)
        375.   {
        376.       unsigned int i, m;

crypto/bn/bn_lib.c:396:9: Call
        394.       i = ((n - 1) / BN_BYTES) + 1;
        395.       m = ((n - 1) % (BN_BYTES));
        396.       if (bn_wexpand(ret, (int)i) == NULL) {
                       ^
        397.           BN_free(bn);
        398.           return NULL;

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/rsa/rsa_x931g.c:170:10: Call
168.       /* Generate two primes from Xp, Xq */
169.   
170.       if (!BN_X931_generate_prime_ex(rsa->p, NULL, NULL, NULL, NULL, Xp,
                ^
171.                                      e, ctx, cb))
172.           goto error;

crypto/bn/bn_x931p.c:215:1: Parameter `*p->d`
  213.    */
  214.   
  215. > int BN_X931_generate_prime_ex(BIGNUM *p, BIGNUM *p1, BIGNUM *p2,
  216.                                 BIGNUM *Xp1, BIGNUM *Xp2,
  217.                                 const BIGNUM *Xp,

crypto/bn/bn_x931p.c:234:10: Call
  232.       if (!BN_priv_rand(Xp2, 101, BN_RAND_TOP_ONE, BN_RAND_BOTTOM_ANY))
  233.           goto error;
  234.       if (!BN_X931_derive_prime_ex(p, p1, p2, Xp, Xp1, Xp2, e, ctx, cb))
                  ^
  235.           goto error;
  236.   

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: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 `*b`
              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:727:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_X931_generate_prime_ex` 
              725.       for (i = n - 2; i >= 0; i--) {
              726.           aa = a[i];
              727.           bb = b[i];
                                  ^
              728.           if (aa != bb)
              729.               return ((aa > bb) ? 1 : -1);
