apps/s_client.c:291: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp`.
Showing all 34 steps of the trace


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

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

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

apps/s_client.c:285:9: Call
283.       int ret =
284.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
285.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
286.           p != NULL && BN_rshift1(p, N) &&
287.           /* 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:580:1: Parameter `a->top`
      578.   }
      579.   
      580. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      581.   {
      582.       int i;

apps/s_client.c:286:22: Call
284.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
285.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
286.           p != NULL && BN_rshift1(p, N) &&
                            ^
287.           /* p = (N-1)/2 */
288.           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:855:1: Parameter `a->top`
    853.   }
    854.   
    855. > int BN_is_zero(const BIGNUM *a)
    856.   {
    857.       return a->top == 0;

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

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

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

crypto/bn/bn_exp.c:141:19: Call
  139.               && (BN_get_flags(m, BN_FLG_CONSTTIME) == 0)) {
  140.               BN_ULONG A = a->d[0];
  141.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  142.           } else
  143.   # endif

crypto/bn/bn_exp.c:1095:1: Parameter `m->top`
    1093.   }
    1094.   
    1095. > int BN_mod_exp_mont_word(BIGNUM *rr, BN_ULONG a, const BIGNUM *p,
    1096.                            const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
    1097.   {

crypto/bn/bn_exp.c:1131:10: Call
    1129.       bn_check_top(m);
    1130.   
    1131.       if (!BN_is_odd(m)) {
                     ^
    1132.           BNerr(BN_F_BN_MOD_EXP_MONT_WORD, BN_R_CALLED_WITH_EVEN_MODULUS);
    1133.           return (0);

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

crypto/bn/bn_exp.c:1185:22: Call
    1183.                   r_is_one = 0;
    1184.               } else {
    1185.                   if (!BN_MOD_MUL_WORD(r, w, m))
                                 ^
    1186.                       goto err;
    1187.               }

crypto/bn/bn_div.c:202:31: Call
      200.   
      201.       /* First we normalise the numbers */
      202.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      203.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      204.           goto err;

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

crypto/bn/bn_div.c:202:5: Assignment
      200.   
      201.       /* First we normalise the numbers */
      202.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      203.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      204.           goto err;

crypto/bn/bn_div.c:203:11: Call
      201.       /* First we normalise the numbers */
      202.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      203.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      204.           goto err;
      205.       sdiv->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:951:1: Parameter `*a->d`
          949.   }
          950.   
          951. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          952.   {
          953.       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 `BN_mod_exp` 
        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.           }
