crypto/dsa/dsa_ossl.c:306: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_div`.
Showing all 14 steps of the trace


crypto/dsa/dsa_ossl.c:263:18: Call
261.                * This protects the private key from a weak PRNG.
262.                */
263.               if (!BN_generate_dsa_nonce(k, dsa->q, dsa->priv_key, dgst,
                        ^
264.                                          dlen, ctx))
265.                   goto err;

crypto/bn/bn_rand.c:298:1: Parameter `out->top`
  296.    * used.
  297.    */
  298. > int BN_generate_dsa_nonce(BIGNUM *out, const BIGNUM *range,
  299.                             const BIGNUM *priv, const unsigned char *message,
  300.                             size_t message_len, BN_CTX *ctx)

crypto/dsa/dsa_ossl.c:306:10: Call
304.       DSA_BN_MOD_EXP(goto err, dsa, r, dsa->g, K, dsa->p, ctx,
305.                      dsa->method_mont_p);
306.       if (!BN_mod(r, r, dsa->q, ctx))
                ^
307.           goto err;
308.   

crypto/bn/bn_div.c:188:1: Parameter `num->top`
  186.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  187.    */
  188. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  189.              BN_CTX *ctx)
  190.   {

crypto/bn/bn_div.c:258:11: Call
  256.       sdiv->neg = 0;
  257.       norm_shift += BN_BITS2;
  258.       if (!(BN_lshift(snum, num, norm_shift)))
                   ^
  259.           goto err;
  260.       snum->neg = 0;

crypto/bn/bn_shift.c:129:1: <Offset trace>
127.   }
128.   
129. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
130.   {
131.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:129:1: Parameter `n`
    127.   }
    128.   
    129. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    130.   {
    131.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:144:5: Assignment
    142.   
    143.       r->neg = a->neg;
    144.       nw = n / BN_BITS2;
               ^
    145.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
    146.           return (0);

crypto/bn/bn_shift.c:129:1: <Length trace>
127.   }
128.   
129. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
130.   {
131.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:129:1: Parameter `*r->d`
    127.   }
    128.   
    129. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
    130.   {
    131.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:9: Call
    143.       r->neg = a->neg;
    144.       nw = n / BN_BITS2;
    145.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                   ^
    146.           return (0);
    147.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
      1069.   }
      1070.   
      1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1072.   {
      1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:150:5: Assignment
    148.       rb = BN_BITS2 - lb;
    149.       f = a->d;
    150.       t = r->d;
               ^
    151.       t[a->top + nw] = 0;
    152.       if (lb == 0)

crypto/bn/bn_shift.c:158:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_div` 
    156.           for (i = a->top - 1; i >= 0; i--) {
    157.               l = f[i];
    158.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                       ^
    159.               t[nw + i] = (l << lb) & BN_MASK2;
    160.           }
