ssl/statem/statem_srvr.c:2379: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `srp_generate_server_master_secret`.
Showing all 22 steps of the trace


ssl/statem/statem_srvr.c:2361:29: Call
2359.               goto f_err;
2360.           }
2361.           if ((s->srp_ctx.A = BN_bin2bn(data, i, NULL)) == NULL) {
                                    ^
2362.               SSLerr(SSL_F_TLS_PROCESS_CLIENT_KEY_EXCHANGE, ERR_R_BN_LIB);
2363.               goto err;

crypto/bn/bn_lib.c:492:9: Assignment
  490.       n = len;
  491.       if (n == 0) {
  492.           ret->top = 0;
                 ^
  493.           return (ret);
  494.       }

ssl/statem/statem_srvr.c:2379:14: Call
2377.           }
2378.   
2379.           if (!srp_generate_server_master_secret(s)) {
                     ^
2380.               SSLerr(SSL_F_TLS_PROCESS_CLIENT_KEY_EXCHANGE, ERR_R_INTERNAL_ERROR);
2381.               goto err;

ssl/tls_srp.c:284:1: Parameter `s->srp_ctx.A->top`
  282.   }
  283.   
  284. > int srp_generate_server_master_secret(SSL *s)
  285.   {
  286.       BIGNUM *K = NULL, *u = NULL;

ssl/tls_srp.c:290:10: Call
  288.       unsigned char *tmp = NULL;
  289.   
  290.       if (!SRP_Verify_A_mod_N(s->srp_ctx.A, s->srp_ctx.N))
                  ^
  291.           goto err;
  292.       if ((u = SRP_Calc_u(s->srp_ctx.A, s->srp_ctx.B, s->srp_ctx.N)) == NULL)

crypto/srp/srp_lib.c:274:1: Parameter `A->top`
    272.   }
    273.   
    274. > int SRP_Verify_A_mod_N(const BIGNUM *A, const BIGNUM *N)
    275.   {
    276.       /* Checks if A % N == 0 */

crypto/srp/srp_lib.c:277:12: Call
    275.   {
    276.       /* Checks if A % N == 0 */
    277.       return SRP_Verify_B_mod_N(A, N);
                      ^
    278.   }
    279.   

crypto/srp/srp_lib.c:253:1: Parameter `B->top`
      251.   }
      252.   
      253. > int SRP_Verify_B_mod_N(const BIGNUM *B, const BIGNUM *N)
      254.   {
      255.       BIGNUM *r;

crypto/srp/srp_lib.c:265:10: Call
      263.           goto err;
      264.       /* Checks if B % N == 0 */
      265.       if (!BN_nnmod(r, B, N, bn_ctx))
                      ^
      266.           goto err;
      267.       ret = !BN_is_zero(r);

crypto/bn/bn_mod.c:13:1: Parameter `m->top`
        11.   #include "bn_lcl.h"
        12.   
        13. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
        14.   {
        15.       /*

crypto/bn/bn_mod.c:20:11: Call
        18.        */
        19.   
        20.       if (!(BN_mod(r, m, d, ctx)))
                        ^
        21.           return 0;
        22.       if (!r->neg)

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: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 `srp_generate_server_master_secret` 
            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.           }
