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


apps/s_client.c:284:9: Call
282.       int ret =
283.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
284.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
285.           p != NULL && BN_rshift1(p, N) &&
286.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:182:12: Call
  180.                      BN_GENCB *cb)
  181.   {
  182.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  183.   }
  184.   

crypto/bn/bn_prime.c:223:11: Call
    221.           goto err;
    222.   
    223.       ret = bn_miller_rabin_is_prime(w, checks, ctx, cb, 0, &status);
                     ^
    224.       if (!ret)
    225.           goto err;

crypto/bn/bn_prime.c:315:14: Call
      313.           }
      314.           /* (Step 4.5) z = b^m mod w */
      315.           if (!BN_mod_exp_mont(z, b, m, w, ctx, mont))
                          ^
      316.               goto err;
      317.           /* (Step 4.6) if (z = 1 or z = w-1) */

crypto/bn/bn_exp.c:354:14: Call
        352.   
        353.       if (a->neg || BN_ucmp(a, m) >= 0) {
        354.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        355.               goto err;
        356.           aa = val[0];

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:209:1: Parameter `*dv->d`
            207.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
            208.    */
            209. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
            210.              BN_CTX *ctx)
            211.   {

apps/s_client.c:285:22: Call
283.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
284.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
285.           p != NULL && BN_rshift1(p, N) &&
                            ^
286.           /* p = (N-1)/2 */
287.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&

crypto/bn/bn_shift.c:47:1: Parameter `*r->d`
  45.   }
  46.   
  47. > int BN_rshift1(BIGNUM *r, const BIGNUM *a)
  48.   {
  49.       BN_ULONG *ap, *rp, t, c;

apps/s_client.c:287:9: Call
285.           p != NULL && BN_rshift1(p, N) &&
286.           /* p = (N-1)/2 */
287.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) == 1 &&
               ^
288.           r != NULL &&
289.           /* verify g^((N-1)/2) == -1 (mod N) */

crypto/bn/bn_prime.c:179:1: Parameter `*a->d`
  177.   }
  178.   
  179. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
  180.                      BN_GENCB *cb)
  181.   {

crypto/bn/bn_prime.c:182:12: Call
  180.                      BN_GENCB *cb)
  181.   {
  182.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  183.   }
  184.   

crypto/bn/bn_prime.c:186:1: Parameter `*w->d`
    184.   
    185.   /* See FIPS 186-4 C.3.1 Miller Rabin Probabilistic Primality Test. */
    186. > int BN_is_prime_fasttest_ex(const BIGNUM *w, int checks, BN_CTX *ctx_passed,
    187.                               int do_trial_division, BN_GENCB *cb)
    188.   {

crypto/bn/bn_prime.c:223:11: Call
    221.           goto err;
    222.   
    223.       ret = bn_miller_rabin_is_prime(w, checks, ctx, cb, 0, &status);
                     ^
    224.       if (!ret)
    225.           goto err;

crypto/bn/bn_prime.c:248:1: Parameter `*w->d`
      246.    * returns 0 if there was an error, otherwise it returns 1.
      247.    */
      248. > int bn_miller_rabin_is_prime(const BIGNUM *w, int iterations, BN_CTX *ctx,
      249.                                BN_GENCB *cb, int enhanced, int *status)
      250.   {

crypto/bn/bn_prime.c:315:14: Call
      313.           }
      314.           /* (Step 4.5) z = b^m mod w */
      315.           if (!BN_mod_exp_mont(z, b, m, w, ctx, mont))
                          ^
      316.               goto err;
      317.           /* (Step 4.6) if (z = 1 or z = w-1) */

crypto/bn/bn_exp.c:388:14: <Offset trace>
386.           /* 2^(top*BN_BITS2) - m */
387.           r->d[0] = (0 - m->d[0]) & BN_MASK2;
388.           for (i = 1; i < j; i++)
                    ^
389.               r->d[i] = (~m->d[i]) & BN_MASK2;
390.           r->top = j;

crypto/bn/bn_exp.c:388:14: Assignment
        386.           /* 2^(top*BN_BITS2) - m */
        387.           r->d[0] = (0 - m->d[0]) & BN_MASK2;
        388.           for (i = 1; i < j; i++)
                            ^
        389.               r->d[i] = (~m->d[i]) & BN_MASK2;
        390.           r->top = j;

crypto/bn/bn_exp.c:296:1: <Length trace>
294.   }
295.   
296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
298.   {

crypto/bn/bn_exp.c:296:1: Parameter `*m->d`
        294.   }
        295.   
        296. > int BN_mod_exp_mont(BIGNUM *rr, const BIGNUM *a, const BIGNUM *p,
        297.                       const BIGNUM *m, BN_CTX *ctx, BN_MONT_CTX *in_mont)
        298.   {

crypto/bn/bn_exp.c:389:25: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_is_prime_ex` 
        387.           r->d[0] = (0 - m->d[0]) & BN_MASK2;
        388.           for (i = 1; i < j; i++)
        389.               r->d[i] = (~m->d[i]) & BN_MASK2;
                                       ^
        390.           r->top = j;
        391.           r->flags |= BN_FLG_FIXED_TOP;
