test/sslapitest.c:3897: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 22 steps of the trace


test/sslapitest.c:3897:10: Call
3895.           goto end;
3896.   
3897.       if (!TEST_true(SRP_create_verifier_BN(userid, password, &salt, &verifier,
                 ^
3898.                                             lgN->N, lgN->g)))
3899.           goto end;

crypto/srp/srp_vfy.c:662:1: Parameter `g->top`
  660.    * BIGNUMS.
  661.    */
  662. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  663.                              BIGNUM **verifier, const BIGNUM *N,
  664.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:693:10: Call
  691.           goto err;
  692.   
  693.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  694.           BN_clear_free(*verifier);
  695.           goto err;

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

crypto/bn/bn_exp.c:144:19: Call
    142.           } else
    143.   # endif
    144.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    145.       } else
    146.   #endif

crypto/bn/bn_exp.c:296:1: Parameter `a->top`
      294.   }
      295.   
      296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      298.   {

crypto/bn/bn_exp.c:310:16: Call
      308.               || BN_get_flags(a, BN_FLG_CONSTTIME) != 0
      309.               || BN_get_flags(m, BN_FLG_CONSTTIME) != 0) {
      310.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      311.       }
      312.   

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

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

crypto/bn/bn_mod.c:13:1: Parameter `m->top`
          11.   #include "bn_lcl.h"
          12.   
          13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
          14.   {
          15.       /*

crypto/bn/bn_mod.c:20:11: Call
          18.        */
          19.   
          20.       if (!(BN_mod(r, m, d, ctx)))
                          ^
          21.           return 0;
          22.       if (!r->neg)

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

crypto/bn/bn_div.c:204:11: Call
            202.       sdiv->neg = 0;
            203.       norm_shift += BN_BITS2;
            204.       if (!(BN_lshift(snum, num, norm_shift)))
                             ^
            205.           goto err;
            206.       snum->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:910:1: Parameter `*a->d`
                908.   }
                909.   
                910. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
                911.   {
                912.       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 `SRP_create_verifier_BN` 
              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.           }
