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


apps/s_client.c:252:9: Call
250.       int ret =
251.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
252.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
253.           p != NULL && BN_rshift1(p, N) &&
254.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:197:12: Call
  195.                      BN_GENCB *cb)
  196.   {
  197.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  198.   }
  199.   

crypto/bn/bn_prime.c:200:1: Parameter `a->top`
    198.   }
    199.   
    200. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    201.                               int do_trial_division, BN_GENCB *cb)
    202.   {

crypto/bn/bn_prime.c:210:9: Call
    208.       const BIGNUM *A = NULL;
    209.   
    210.       if (BN_cmp(a, BN_value_one()) <= 0)
                   ^
    211.           return 0;
    212.   

crypto/bn/bn_lib.c:645:1: Parameter `a->top`
      643.   }
      644.   
      645. > int BN_cmp(const BIGNUM *a, const BIGNUM *b)
      646.   {
      647.       int i;

apps/s_client.c:253:22: Call
251.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
252.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
253.           p != NULL && BN_rshift1(p, N) &&
                            ^
254.           /* p = (N-1)/2 */
255.           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:920:1: Parameter `a->top`
    918.   }
    919.   
    920. > int BN_is_zero(const BIGNUM *a)
    921.   {
    922.       return a->top == 0;

apps/s_client.c:258:9: Call
256.           r != NULL &&
257.           /* verify g^((N-1)/2) == -1 (mod N) */
258.           BN_mod_exp(r, g, p, N, bn_ctx) &&
               ^
259.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
260.   

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:147:19: Call
  145.               && (BN_get_flags(p, BN_FLG_CONSTTIME) == 0)) {
  146.               BN_ULONG A = a->d[0];
  147.               ret = BN_mod_exp_mont_word(r, A, p, m, ctx, NULL);
                           ^
  148.           } else
  149.   # endif

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

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

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:1187:22: Call
    1185.                   r_is_one = 0;
    1186.               } else {
    1187.                   if (!BN_MOD_MUL_WORD(r, w, m))
                                 ^
    1188.                       goto err;
    1189.               }

crypto/bn/bn_div.c:205:31: Call
      203.   
      204.       /* First we normalise the numbers */
      205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                                           ^
      206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      207.           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:205:5: Assignment
      203.   
      204.       /* First we normalise the numbers */
      205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
                 ^
      206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
      207.           goto err;

crypto/bn/bn_div.c:206:11: Call
      204.       /* First we normalise the numbers */
      205.       norm_shift = BN_BITS2 - ((BN_num_bits(divisor)) % BN_BITS2);
      206.       if (!(BN_lshift(sdiv, divisor, norm_shift)))
                       ^
      207.           goto err;
      208.       sdiv->neg = 0;

crypto/bn/bn_shift.c:81:1: <Offset trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `n`
        79.   }
        80.   
        81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        82.   {
        83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:96:5: Assignment
        94.   
        95.       r->neg = a->neg;
        96.       nw = n / BN_BITS2;
                  ^
        97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
        98.           return (0);

crypto/bn/bn_shift.c:81:1: <Length trace>
79.   }
80.   
81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
82.   {
83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:81:1: Parameter `*r->d`
        79.   }
        80.   
        81. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
        82.   {
        83.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:97:9: Call
        95.       r->neg = a->neg;
        96.       nw = n / BN_BITS2;
        97.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                       ^
        98.           return (0);
        99.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:1016:1: Parameter `*a->d`
          1014.   }
          1015.   
          1016. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
          1017.   {
          1018.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:102:5: Assignment
        100.       rb = BN_BITS2 - lb;
        101.       f = a->d;
        102.       t = r->d;
                   ^
        103.       t[a->top + nw] = 0;
        104.       if (lb == 0)

crypto/bn/bn_shift.c:110:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_mod_exp` 
        108.           for (i = a->top - 1; i >= 0; i--) {
        109.               l = f[i];
        110.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                           ^
        111.               t[nw + i] = (l << lb) & BN_MASK2;
        112.           }
