apps/gendsa.c:127: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `DSA_generate_key`.
Showing all 25 steps of the trace


apps/gendsa.c:126:58: Call
124.   
125.       DSA_get0_pqg(dsa, &p, NULL, NULL);
126.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
                                                                ^
127.       if (!DSA_generate_key(dsa))
128.           goto end;

crypto/bn/bn_lib.c:166:9: Call
  164.       bn_check_top(a);
  165.   
  166.       if (BN_is_zero(a))
                 ^
  167.           return 0;
  168.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:920:1: Parameter `a->top`
    918.   }
    919.   
    920. > int BN_is_zero(const BIGNUM *a)
    921.   {
    922.       return a->top == 0;

apps/gendsa.c:127:10: Call
125.       DSA_get0_pqg(dsa, &p, NULL, NULL);
126.       BIO_printf(bio_err, "Generating DSA key, %d bits\n", BN_num_bits(p));
127.       if (!DSA_generate_key(dsa))
                ^
128.           goto end;
129.   

crypto/dsa/dsa_key.c:18:1: Parameter `dsa->g->top`
  16.   static int dsa_builtin_keygen(DSA *dsa);
  17.   
  18. > int DSA_generate_key(DSA *dsa)
  19.   {
  20.       if (dsa->meth->dsa_keygen)

crypto/dsa/dsa_key.c:22:12: Call
  20.       if (dsa->meth->dsa_keygen)
  21.           return dsa->meth->dsa_keygen(dsa);
  22.       return dsa_builtin_keygen(dsa);
                   ^
  23.   }
  24.   

crypto/dsa/dsa_key.c:25:1: Parameter `dsa->g->top`
    23.   }
    24.   
    25. > static int dsa_builtin_keygen(DSA *dsa)
    26.   {
    27.       int ok = 0;

crypto/dsa/dsa_key.c:58:14: Call
    56.           BN_with_flags(prk, priv_key, BN_FLG_CONSTTIME);
    57.   
    58.           if (!BN_mod_exp(pub_key, dsa->g, prk, dsa->p, ctx)) {
                       ^
    59.               BN_free(prk);
    60.               goto err;

crypto/bn/bn_exp.c:91:1: Parameter `a->top`
      89.   }
      90.   
      91. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
      92.                  BN_CTX *ctx)
      93.   {

crypto/bn/bn_exp.c:151:19: Call
      149.           } else
      150.   # endif
      151.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                               ^
      152.       } else
      153.   #endif

crypto/bn/bn_exp.c:301:1: Parameter `a->top`
        299.   }
        300.   
        301. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        302.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
        303.   {

crypto/bn/bn_exp.c:313:16: Call
        311.   
        312.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
        313.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                              ^
        314.       }
        315.   

crypto/bn/bn_exp.c:601:1: Parameter `a->top`
          599.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
          600.    */
          601. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
          602.                                 const BIGNUM *m, BN_CTX *ctx,
          603.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:754:14: Call
          752.       /* prepare a^1 in Montgomery domain */
          753.       if (a->neg || BN_ucmp(a, m) >= 0) {
          754.           if (!BN_mod(&am, a, m, ctx))
                              ^
          755.               goto err;
          756.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_div.c:140:1: Parameter `num->top`
            138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            139.    */
            140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            141.              BN_CTX *ctx)
            142.   {

crypto/bn/bn_div.c:210:11: Call
            208.       sdiv->neg = 0;
            209.       norm_shift += BN_BITS2;
            210.       if (!(BN_lshift(snum, num, norm_shift)))
                             ^
            211.           goto err;
            212.       snum->neg = 0;

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

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

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

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

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

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

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
                1014.   }
                1015.   
                1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                1017.   {
                1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

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

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