apps/s_client.c:314: 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:295:9: Call
293.           BIO_printf(bio_err, "SRP parameters:\n");
294.           BIO_printf(bio_err, "\tN=");
295.           BN_print(bio_err, N);
               ^
296.           BIO_printf(bio_err, "\n\tg=");
297.           BN_print(bio_err, g);

crypto/bn/bn_print.c:295:1: Parameter `a->top`
  293.   # endif
  294.   
  295. > int BN_print(BIO *bp, const BIGNUM *a)
  296.   {
  297.       int i, j, v, z = 0;

apps/s_client.c:297:9: Call
295.           BN_print(bio_err, N);
296.           BIO_printf(bio_err, "\n\tg=");
297.           BN_print(bio_err, g);
               ^
298.           BIO_printf(bio_err, "\n");
299.       }

crypto/bn/bn_print.c:295:1: Parameter `a->top`
  293.   # endif
  294.   
  295. > int BN_print(BIO *bp, const BIGNUM *a)
  296.   {
  297.       int i, j, v, z = 0;

apps/s_client.c:301:9: Call
299.       }
300.   
301.       if (SRP_check_known_gN_param(g, N))
               ^
302.           return 1;
303.   

crypto/srp/srp_lib.c:295:1: Parameter `g->top`
  293.    * from the ietf-tls-srp draft version 8
  294.    */
  295. > char *SRP_check_known_gN_param(BIGNUM *g, BIGNUM *N)
  296.   {
  297.       size_t i;

apps/s_client.c:314:13: Call
312.            * has already been tested.
313.            */
314.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                   ^
315.               return 1;
316.       }

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:918:1: Parameter `a->top`
    916.   }
    917.   
    918. > int BN_is_zero(const BIGNUM *a)
    919.   {
    920.       return a->top == 0;

apps/s_client.c:314:42: Call
312.            * has already been tested.
313.            */
314.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                                                ^
315.               return 1;
316.       }

apps/s_client.c:247:1: Parameter `g->top`
  245.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
  246.   
  247. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
  248.   {
  249.       BN_CTX *bn_ctx = BN_CTX_new();

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

crypto/bn/bn_exp.c:90:1: Parameter `a->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:150:19: Call
    148.           } else
    149.   # endif
    150.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    151.       } else
    152.   #endif

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

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

crypto/bn/bn_exp.c:592:1: Parameter `a->top`
        590.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        591.    */
        592. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        593.                                 const BIGNUM *m, BN_CTX *ctx,
        594.                                 BN_MONT_CTX *in_mont)

crypto/bn/bn_exp.c:745:14: Call
        743.       /* prepare a^1 in Montgomery domain */
        744.       if (a->neg || BN_ucmp(a, m) >= 0) {
        745.           if (!BN_mod(&am, a, m, ctx))
                            ^
        746.               goto err;
        747.           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: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:1014:1: Parameter `*a->d`
              1012.   }
              1013.   
              1014. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              1015.   {
              1016.       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 `srp_Verify_N_and_g` 
            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.           }
