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


apps/s_client.c:281:9: Call
279.           BIO_printf(bio_err, "SRP parameters:\n");
280.           BIO_printf(bio_err, "\tN=");
281.           BN_print(bio_err, N);
               ^
282.           BIO_printf(bio_err, "\n\tg=");
283.           BN_print(bio_err, g);

crypto/bn/bn_print.c:304:1: Parameter `a->top`
  302.   # endif
  303.   
  304. > int BN_print(BIO *bp, const BIGNUM *a)
  305.   {
  306.       int i, j, v, z = 0;

apps/s_client.c:283:9: Call
281.           BN_print(bio_err, N);
282.           BIO_printf(bio_err, "\n\tg=");
283.           BN_print(bio_err, g);
               ^
284.           BIO_printf(bio_err, "\n");
285.       }

crypto/bn/bn_print.c:304:1: Parameter `a->top`
  302.   # endif
  303.   
  304. > int BN_print(BIO *bp, const BIGNUM *a)
  305.   {
  306.       int i, j, v, z = 0;

apps/s_client.c:287:9: Call
285.       }
286.   
287.       if (SRP_check_known_gN_param(g, N))
               ^
288.           return 1;
289.   

crypto/srp/srp_lib.c:255:1: Parameter `g->top`
  253.    * from the ietf-tls-srp draft version 8
  254.    */
  255. > char *SRP_check_known_gN_param(const BIGNUM *g, const BIGNUM *N)
  256.   {
  257.       size_t i;

apps/s_client.c:300:13: Call
298.            * has already been tested.
299.            */
300.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                   ^
301.               return 1;
302.       }

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

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:300:42: Call
298.            * has already been tested.
299.            */
300.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                                                ^
301.               return 1;
302.       }

apps/s_client.c:233:1: Parameter `g->top`
  231.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
  232.   
  233. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
  234.   {
  235.       BN_CTX *bn_ctx = BN_CTX_new();

apps/s_client.c:246:9: Call
  244.           r != NULL &&
  245.           /* verify g^((N-1)/2) == -1 (mod N) */
  246.           BN_mod_exp(r, g, p, N, bn_ctx) &&
                 ^
  247.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
  248.   

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

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

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

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

crypto/bn/bn_exp.c:601:1: Parameter `a->top`
        599.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        600.    */
        601. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        602.                                 const BIGNUM *m, BN_CTX *ctx,
        603.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:754:14: Call
        752.       /* prepare a^1 in Montgomery domain */
        753.       if (a->neg || BN_ucmp(a, m) >= 0) {
        754.           if (!BN_mod(&am, a, m, ctx))
                            ^
        755.               goto err;
        756.           if (!BN_to_montgomery(&am, &am, mont, ctx))

crypto/bn/bn_div.c:140:1: Parameter `num->top`
          138.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
          139.    */
          140. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
          141.              BN_CTX *ctx)
          142.   {

crypto/bn/bn_div.c:210:11: Call
          208.       sdiv->neg = 0;
          209.       norm_shift += BN_BITS2;
          210.       if (!(BN_lshift(snum, num, norm_shift)))
                           ^
          211.           goto err;
          212.       snum->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: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: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 `srp_Verify_N_and_g` 
            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.           }
