crypto/srp/srp_vfy.c:571: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `SRP_create_verifier_BN`.
Showing all 32 steps of the trace


crypto/srp/srp_vfy.c:544:22: Call
542.           if ((len = t_fromb64(tmp, N)) == 0)
543.               goto err;
544.           N_bn_alloc = BN_bin2bn(tmp, len, NULL);
                            ^
545.           N_bn = N_bn_alloc;
546.           if ((len = t_fromb64(tmp, g)) == 0)

crypto/bn/bn_lib.c:492:9: Assignment
  490.       n = len;
  491.       if (n == 0) {
  492.           ret->top = 0;
                 ^
  493.           return (ret);
  494.       }

crypto/srp/srp_vfy.c:571:10: Call
569.       }
570.   
571.       if (!SRP_create_verifier_BN(user, pass, &s, &v, N_bn, g_bn))
                ^
572.           goto err;
573.   

crypto/srp/srp_vfy.c:612:1: Parameter `N->top`
  610.    * BIGNUMS.
  611.    */
  612. > int SRP_create_verifier_BN(const char *user, const char *pass, BIGNUM **salt,
  613.                              BIGNUM **verifier, const BIGNUM *N,
  614.                              const BIGNUM *g)

crypto/srp/srp_vfy.c:643:10: Call
  641.           goto err;
  642.   
  643.       if (!BN_mod_exp(*verifier, g, x, N, bn_ctx)) {
                  ^
  644.           BN_clear_free(*verifier);
  645.           goto err;

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

crypto/bn/bn_exp.c:142:9: Call
    140.       /* if ((m->d[m->top-1]&BN_TBIT) && BN_is_odd(m)) */
    141.   
    142.       if (BN_is_odd(m)) {
                   ^
    143.   # ifdef MONT_EXP_WORD
    144.           if (a->top == 1 && !a->neg

crypto/bn/bn_lib.c:935:1: Parameter `a->top`
      933.   }
      934.   
      935. > int BN_is_odd(const BIGNUM *a)
      936.   {
      937.       return (a->top > 0) && (a->d[0] & 1);

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

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

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

crypto/bn/bn_exp.c:743:14: Assignment
        741.           /* 2^(top*BN_BITS2) - m */
        742.           tmp.d[0] = (0 - m->d[0]) & BN_MASK2;
        743.           for (i = 1; i < top; i++)
                            ^
        744.               tmp.d[i] = (~m->d[i]) & BN_MASK2;
        745.           tmp.top = top;

crypto/bn/bn_exp.c:1042:14: Call
        1040.           for (wvalue = 0, i = bits % window; i >= 0; i--, bits--)
        1041.               wvalue = (wvalue << 1) + BN_is_bit_set(p, bits);
        1042.           if (!MOD_EXP_CTIME_COPY_FROM_PREBUF(&tmp, top, powerbuf, wvalue,
                             ^
        1043.                                               window))
        1044.               goto err;

crypto/bn/bn_exp.c:524:1: Parameter `top`
          522.   }
          523.   
          524. > static int MOD_EXP_CTIME_COPY_FROM_PREBUF(BIGNUM *b, int top,
          525.                                             unsigned char *buf, int idx,
          526.                                             int window)

crypto/bn/bn_exp.c:581:5: Assignment
          579.       }
          580.   
          581.       b->top = top;
                     ^
          582.       bn_correct_top(b);
          583.       return 1;

crypto/bn/bn_exp.c:582:5: Call
          580.   
          581.       b->top = top;
          582.       bn_correct_top(b);
                     ^
          583.       return 1;
          584.   }

crypto/bn/bn_lib.c:1021:1: Parameter `a->top`
            1019.   }
            1020.   
            1021. > void bn_correct_top(BIGNUM *a)
            1022.   {
            1023.       BN_ULONG *ftl;

crypto/bn/bn_exp.c:1055:22: Call
        1053.               /* Scan the window, squaring the result as we go */
        1054.               for (i = 0; i < window; i++, bits--) {
        1055.                   if (!BN_mod_mul_montgomery(&tmp, &tmp, &tmp, mont, ctx))
                                     ^
        1056.                       goto err;
        1057.                   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:104:1: <Offset trace>
102.   
103.   /* tmp must have 2*n words */
104. > void bn_sqr_normal(BN_ULONG *r, const BN_ULONG *a, int n, BN_ULONG *tmp)
105.   {
106.       int i, j, max;

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

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

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

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

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

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

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

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