test/srptest.c:177: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 30 steps of the trace


test/srptest.c:177:10: Call
175.       BN_hex2bn(&s, "BEB25379D1A8581EB5A727673A2441EE");
176.       /* Set up server's password entry */
177.       if (!TEST_true(SRP_create_verifier_BN("alice", "password123", &s, &v, GN->N,
                ^
178.                                   GN->g)))
179.           goto err;

crypto/srp/srp_vfy.c:633:1: Parameter `N->top`
  631.    * BIGNUMS.
  632.    */
  633. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  634.                              BIGNUM **verifier, const BIGNUM *N,
  635.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:664:10: Call
  662.           goto err;
  663.   
  664.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  665.           BN_clear_free(*verifier);
  666.           goto err;

crypto/bn/bn_exp.c:91:1: Parameter `m->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:136:9: Call
    134.   
    135.   #ifdef MONT_MUL_MOD
    136.       if (BN_is_odd(m)) {
                   ^
    137.   # ifdef MONT_EXP_WORD
    138.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:867:1: Parameter `a->top`
      865.   }
      866.   
      867. > int BN_is_odd(const BIGNUM *a)
      868.   {
      869.       return (a->top > 0) && (a->d[0] & 1);

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:294:1: Parameter `m->top`
      292.   }
      293.   
      294. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      295.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      296.   {

crypto/bn/bn_exp.c:306:16: Call
      304.   
      305.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
      306.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      307.       }
      308.   

crypto/bn/bn_exp.c:737:14: Assignment
        735.           /* 2^(top*BN_BITS2) - m */
        736.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
        737.           for (i = 1; i < top; i++)
                            ^
        738.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
        739.           tmp.top = top;

crypto/bn/bn_exp.c:1036:14: Call
        1034.           for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
        1035.               wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
        1036.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                             ^
        1037.                                               window))
        1038.               goto err;

crypto/bn/bn_exp.c:518:1: Parameter `top`
          516.   }
          517.   
          518. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
          519.                                             unsigned char *buf, int idx,
          520.                                             int window)

crypto/bn/bn_exp.c:575:5: Assignment
          573.       }
          574.   
          575.       b->top = top;
                     ^
          576.       bn_correct_top(b);
          577.       return 1;

crypto/bn/bn_exp.c:576:5: Call
          574.   
          575.       b->top = top;
          576.       bn_correct_top(b);
                     ^
          577.       return 1;
          578.   }

crypto/bn/bn_lib.c:953:1: Parameter `a->top`
            951.   }
            952.   
            953. > void bn_correct_top(BIGNUM *a)
            954.   {
            955.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1049:22: Call
        1047.               /* Scan the window, squaring the result as we go */
        1048.               for (i = 0; i < window; i++, bits--) {
        1049.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                     ^
        1050.                       goto err;
        1051.                   wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);

crypto/bn/bn_mont.c:26:1: Parameter `a->top`
          24.   #endif
          25.   
          26. > int BN_mod_mul_montgomery(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
          27.                             BN_MONT_CTX *mont, BN_CTX *ctx)
          28.   {

crypto/bn/bn_mont.c:53:14: Call
          51.       bn_check_top(tmp);
          52.       if (a == b) {
          53.           if (!BN_sqr(tmp, a, ctx))
                             ^
          54.               goto err;
          55.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `a->top`
            15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
            16.    */
            17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
            18.   {
            19.       int max, al;

crypto/bn/bn_sqr.c:25:5: Assignment
            23.       bn_check_top(a);
            24.   
            25.       al = a->top;
                      ^
            26.       if (al <= 0) {
            27.           r->top = 0;

crypto/bn/bn_sqr.c:74:17: Call
            72.                   if (bn_wexpand(tmp, max) == NULL)
            73.                       goto err;
            74.                   bn_sqr_normal(rr->d, a->d, al, tmp->d);
                                  ^
            75.               }
            76.           }

crypto/bn/bn_sqr.c:105:1: <Offset trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `n`
              103.   
              104.   /* tmp must have 2*n words */
              105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
              106.   {
              107.       int i, j, max;

crypto/bn/bn_sqr.c:116:5: Assignment
              114.       rp[0] = rp[max - 1] = 0;
              115.       rp++;
              116.       j = n;
                         ^
              117.   
              118.       if (--j > 0) {

crypto/bn/bn_sqr.c:118:9: Assignment
              116.       j = n;
              117.   
              118.       if (--j > 0) {
                             ^
              119.           ap++;
              120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);

crypto/bn/bn_sqr.c:105:1: <Length trace>
103.   
104.   /* tmp must have 2*n words */
105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
106.   {
107.       int i, j, max;

crypto/bn/bn_sqr.c:105:1: Parameter `*r`
              103.   
              104.   /* tmp must have 2*n words */
              105. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
              106.   {
              107.       int i, j, max;

crypto/bn/bn_sqr.c:113:5: Assignment
              111.       max = n * 2;
              112.       ap = a;
              113.       rp = r;
                         ^
              114.       rp[0] = rp[max - 1] = 0;
              115.       rp++;

crypto/bn/bn_sqr.c:115:5: Assignment
              113.       rp = r;
              114.       rp[0] = rp[max - 1] = 0;
              115.       rp++;
                         ^
              116.       j = n;
              117.   

crypto/bn/bn_sqr.c:120:9: Array access: Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_create_verifier_BN` 
              118.       if (--j > 0) {
              119.           ap++;
              120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                             ^
              121.           rp += 2;
              122.       }
