apps/prime.c:96: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_generate_prime_ex`.
Showing all 18 steps of the trace


apps/prime.c:96:14: Call
94.               goto end;
95.           }
96.           if (!BN_generate_prime_ex(bn, bits, safe, NULL, NULL, NULL)) {
                   ^
97.               BIO_printf(bio_err, "Failed to generate prime.\n");
98.               goto end;

crypto/bn/bn_prime.c:52:1: Parameter `add->top`
  50.   }
  51.   
  52. > int BN_generate_prime_ex(BIGNUM *ret, int bits, int safe,
  53.                            const BIGNUM *add, const BIGNUM *rem, BN_GENCB *cb)
  54.   {

crypto/bn/bn_prime.c:93:18: Call
  91.                   goto err;
  92.           } else {
  93.               if (!bn_probable_prime_dh(ret, bits, add, rem, ctx))
                         ^
  94.                   goto err;
  95.           }

crypto/bn/bn_prime.c:355:1: Parameter `add->top`
    353.   }
    354.   
    355. > int bn_probable_prime_dh(BIGNUM *rnd, int bits,
    356.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx)
    357.   {

crypto/bn/bn_prime.c:370:10: Call
    368.       /* we need ((rnd-rem) % add) == 0 */
    369.   
    370.       if (!BN_mod(t1, rnd, add, ctx))
                    ^
    371.           goto err;
    372.       if (!BN_sub(rnd, rnd, t1))

crypto/bn/bn_div.c:250:31: Call
      248.   
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      252.           goto err;

crypto/bn/bn_lib.c:141:9: Assignment
        139.   
        140.       if (BN_is_zero(a))
        141.           return 0;
                       ^
        142.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
        143.   }

crypto/bn/bn_div.c:250:5: Assignment
      248.   
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      252.           goto err;

crypto/bn/bn_div.c:251:11: Call
      249.       /* First we normalise the numbers */
      250.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      251.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      252.           goto err;
      253.       sdiv->neg = 0;

crypto/bn/bn_shift.c:83:1: <Offset trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `n`
        81.   }
        82.   
        83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        84.   {
        85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:5: Assignment
        95.       }
        96.   
        97.       nw = n / BN_BITS2;
                   ^
        98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        99.           return 0;

crypto/bn/bn_shift.c:83:1: <Length trace>
81.   }
82.   
83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
84.   {
85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:83:1: Parameter `*r->d`
        81.   }
        82.   
        83. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        84.   {
        85.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:98:9: Call
        96.   
        97.       nw = n / BN_BITS2;
        98.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        99.           return 0;
        100.       r->neg = a->neg;

crypto/bn/bn_lib.c:939:1: Parameter `*a->d`
          937.   }
          938.   
          939. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          940.   {
          941.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:104:5: Assignment
        102.       rb = BN_BITS2 - lb;
        103.       f = a->d;
        104.       t = r->d;
                   ^
        105.       t[a->top + nw] = 0;
        106.       if (lb == 0)

crypto/bn/bn_shift.c:112:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_generate_prime_ex` 
        110.           for (i = a->top - 1; i >= 0; i--) {
        111.               l = f[i];
        112.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        113.               t[nw + i] = (l << lb) & BN_MASK2;
        114.           }
