apps/s_client.c:388: 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:369:9: Call
367.           BIO_printf(bio_err, "SRP parameters:\n");
368.           BIO_printf(bio_err, "\tN=");
369.           BN_print(bio_err, N);
               ^
370.           BIO_printf(bio_err, "\n\tg=");
371.           BN_print(bio_err, g);

crypto/bn/bn_print.c:340:1: Parameter `a->top`
  338.   # endif
  339.   
  340. > int BN_print(BIO *bp, const BIGNUM *a)
  341.   {
  342.       int i, j, v, z = 0;

apps/s_client.c:371:9: Call
369.           BN_print(bio_err, N);
370.           BIO_printf(bio_err, "\n\tg=");
371.           BN_print(bio_err, g);
               ^
372.           BIO_printf(bio_err, "\n");
373.       }

crypto/bn/bn_print.c:340:1: Parameter `a->top`
  338.   # endif
  339.   
  340. > int BN_print(BIO *bp, const BIGNUM *a)
  341.   {
  342.       int i, j, v, z = 0;

apps/s_client.c:375:9: Call
373.       }
374.   
375.       if (SRP_check_known_gN_param(g, N))
               ^
376.           return 1;
377.   

crypto/srp/srp_lib.c:340:1: Parameter `g->top`
  338.    * from the ietf-tls-srp draft version 8
  339.    */
  340. > char *SRP_check_known_gN_param(BIGNUM *g, BIGNUM *N)
  341.   {
  342.       size_t i;

apps/s_client.c:388:13: Call
386.            * has already been tested.
387.            */
388.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                   ^
389.               return 1;
390.       }

crypto/bn/bn_lib.c:220:9: Call
  218.       bn_check_top(a);
  219.   
  220.       if (BN_is_zero(a))
                 ^
  221.           return 0;
  222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));

crypto/bn/bn_lib.c:899:1: Parameter `a->top`
    897.   }
    898.   
    899. > int BN_is_zero(const BIGNUM *a)
    900.   {
    901.       return a->top == 0;

apps/s_client.c:388:42: Call
386.            * has already been tested.
387.            */
388.           if (BN_num_bits(g) <= BN_BITS && srp_Verify_N_and_g(N, g))
                                                ^
389.               return 1;
390.       }

apps/s_client.c:321:1: Parameter `g->top`
  319.   # define SRP_NUMBER_ITERATIONS_FOR_PRIME 64
  320.   
  321. > static int srp_Verify_N_and_g(const BIGNUM *N, const BIGNUM *g)
  322.   {
  323.       BN_CTX *bn_ctx = BN_CTX_new();

apps/s_client.c:334:9: Call
  332.           r != NULL &&
  333.           /* verify g^((N-1)/2) == -1 (mod N) */
  334.           BN_mod_exp(r, g, p, N, bn_ctx) &&
                 ^
  335.           BN_add_word(r, 1) && BN_cmp(r, N) == 0;
  336.   

crypto/bn/bn_exp.c:191:1: Parameter `a->top`
    189.   }
    190.   
    191. > int BN_mod_exp(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, const BIGNUM *m,
    192.                  BN_CTX *ctx)
    193.   {

crypto/bn/bn_exp.c:251:19: Call
    249.           } else
    250.   # endif
    251.               ret = BN_mod_exp_mont(r, a, p, m, ctx, NULL);
                             ^
    252.       } else
    253.   #endif

crypto/bn/bn_exp.c:401:1: Parameter `a->top`
      399.   }
      400.   
      401. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
      402.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
      403.   {

crypto/bn/bn_exp.c:413:16: Call
      411.   
      412.       if (BN_get_flags(p, BN_FLG_CONSTTIME) != 0) {
      413.           return BN_mod_exp_mont_consttime(rr, a, p, m, ctx, in_mont);
                            ^
      414.       }
      415.   

crypto/bn/bn_exp.c:655:1: Parameter `a->top`
        653.    * http://www.daemonology.net/hyperthreading-considered-harmful/)
        654.    */
        655. > int BN_mod_exp_mont_consttime(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        656.                                 const BIGNUM *m, BN_CTX *ctx,
        657.                                 BN_MONT_CTX *in_mont)

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

crypto/bn/bn_div.c:189:1: Parameter `num->top`
          187.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
          188.    */
          189. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
          190.              BN_CTX *ctx)
          191.   {

crypto/bn/bn_div.c:259:11: Call
          257.       sdiv->neg = 0;
          258.       norm_shift += BN_BITS2;
          259.       if (!(BN_lshift(snum, num, norm_shift)))
                           ^
          260.           goto err;
          261.       snum->neg = 0;

crypto/bn/bn_shift.c:130:1: <Offset trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `n`
            128.   }
            129.   
            130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            131.   {
            132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:145:5: Assignment
            143.   
            144.       r->neg = a->neg;
            145.       nw = n / BN_BITS2;
                       ^
            146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
            147.           return (0);

crypto/bn/bn_shift.c:130:1: <Length trace>
128.   }
129.   
130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
131.   {
132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:130:1: Parameter `*r->d`
            128.   }
            129.   
            130. > int BN_lshift(BIGNUM *r, const BIGNUM *a, int n)
            131.   {
            132.       int i, nw, lb, rb;

crypto/bn/bn_shift.c:146:9: Call
            144.       r->neg = a->neg;
            145.       nw = n / BN_BITS2;
            146.       if (bn_wexpand(r, a->top + nw + 1) == NULL)
                           ^
            147.           return (0);
            148.       lb = n % BN_BITS2;

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
              993.   }
              994.   
              995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
              996.   {
              997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_shift.c:151:5: Assignment
            149.       rb = BN_BITS2 - lb;
            150.       f = a->d;
            151.       t = r->d;
                       ^
            152.       t[a->top + nw] = 0;
            153.       if (lb == 0)

crypto/bn/bn_shift.c:159:13: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `srp_Verify_N_and_g` 
            157.           for (i = a->top - 1; i >= 0; i--) {
            158.               l = f[i];
            159.               t[nw + i + 1] |= (l >> rb) & BN_MASK2;
                               ^
            160.               t[nw + i] = (l << lb) & BN_MASK2;
            161.           }
