apps/s_client.c:291: error: BUFFER_OVERRUN_L3
  Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_exp`.
Showing all 26 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: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: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:146:15: Call
  144.   #ifdef RECP_MUL_MOD
  145.       {
  146.           ret = BN_mod_exp_recp(r, a, p, m, ctx);
                       ^
  147.       }
  148.   #else

crypto/bn/bn_exp.c:158:1: Parameter `m->top`
    156.   }
    157.   
    158. > int BN_mod_exp_recp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
    159.                       const BIGNUM *m, BN_CTX *ctx)
    160.   {

crypto/bn/bn_exp.c:195:14: Call
    193.       if (m->neg) {
    194.           /* ignore sign of 'm' */
    195.           if (!BN_copy(aa, m))
                        ^
    196.               goto err;
    197.           aa->neg = 0;

crypto/bn/bn_lib.c:323:1: <Offset trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `b->top`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: <Length trace>
321.   }
322.   
323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
324.   {
325.       bn_check_top(b);

crypto/bn/bn_lib.c:323:1: Parameter `*a->d`
      321.   }
      322.   
      323. > BIGNUM *BN_copy(BIGNUM *a, const BIGNUM *b)
      324.   {
      325.       bn_check_top(b);

crypto/bn/bn_lib.c:329:9: Call
      327.       if (a == b)
      328.           return a;
      329.       if (bn_wexpand(a, b->top) == NULL)
                     ^
      330.           return NULL;
      331.   

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_lib.c:333:9: Array access: Offset added: [8, +oo] Size: [0, 536870848] by call to `BN_mod_exp` 
      331.   
      332.       if (b->top > 0)
      333.           memcpy(a->d, b->d, sizeof(b->d[0]) * b->top);
                     ^
      334.   
      335.       if (BN_get_flags(b, BN_FLG_CONSTTIME) != 0)
