apps/s_client.c:290: error: BUFFER_OVERRUN_L3
  Offset: [16, +oo] (⇐ 1 + [15, +oo]) Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 40 steps of the trace


apps/s_client.c:277:1: Parameter `N->top`
275.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
276.   
277. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
278.   {
279.       BN_CTX *bn_ctx = BN_CTX_new();

apps/s_client.c:283:53: Call
281.       BIGNUM *r = BN_new();
282.       int ret =
283.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
                                                           ^
284.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
285.           p != NULL && BN_rshift1(p, N) &&

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);

apps/s_client.c:284:9: Call
282.       int ret =
283.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
284.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
285.           p != NULL && BN_rshift1(p, N) &&
286.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:145:1: Parameter `a->top`
  143.   }
  144.   
  145. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  146.                      BN_GENCB *cb)
  147.   {

crypto/bn/bn_prime.c:148:12: Call
  146.                      BN_GENCB *cb)
  147.   {
  148.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  149.   }
  150.   

crypto/bn/bn_prime.c:151:1: Parameter `a->top`
    149.   }
    150.   
    151. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    152.                               int do_trial_division, BN_GENCB *cb)
    153.   {

crypto/bn/bn_prime.c:160:9: Call
    158.       BN_MONT_CTX *mont = NULL;
    159.   
    160.       if (BN_cmp(a, BN_value_one()) <= 0)
                   ^
    161.           return 0;
    162.   

crypto/bn/bn_lib.c:577:1: Parameter `a->top`
      575.   }
      576.   
      577. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      578.   {
      579.       int i;

apps/s_client.c:285:22: Call
283.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
284.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
285.           p != NULL && BN_rshift1(p, N) &&
                            ^
286.           /* p = (N-1)/2 */
287.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&

crypto/bn/bn_shift.c:54:9: Call
  52.       bn_check_top(a);
  53.   
  54.       if (BN_is_zero(a)) {
                ^
  55.           BN_zero(r);
  56.           return (1);

crypto/bn/bn_lib.c:852:1: Parameter `a->top`
    850.   }
    851.   
    852. > int BN_is_zero(const BIGNUM *a)
    853.   {
    854.       return a->top == 0;

apps/s_client.c:290:9: Call
288.           r != NULL &&
289.           /* verify g^((N-1)/2) == -1 (mod N) */
290.           BN_mod_exp(r, g, p, N, bn_ctx) &&
               ^
291.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
292.   

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

crypto/bn/bn_exp.c:133:9: Call
  131.   
  132.   #ifdef MONT_MUL_MOD
  133.       if (BN_is_odd(m)) {
                 ^
  134.   # ifdef MONT_EXP_WORD
  135.           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:141:19: Call
  139.           } else
  140.   # endif
  141.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                           ^
  142.       } else
  143.   #endif

crypto/bn/bn_exp.c:291:1: Parameter `m->top`
    289.   }
    290.   
    291. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
    292.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    293.   {

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

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

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

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

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

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

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:1059:18: Call
      1057.   
      1058.               /* Multiply the result into the intermediate result */
      1059.               if (!BN_mod_mul_montgomery(&tmp, &tmp, &am, mont, ctx))
                               ^
      1060.                   goto err;
      1061.           }

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 `BN_mod_exp` 
            118.       if (--j > 0) {
            119.           ap++;
            120.           rp[j] = bn_mul_words(rp, ap, j, ap[-1]);
                           ^
            121.           rp += 2;
            122.       }
