apps/s_client.c:347: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rshift1`.
Showing all 18 steps of the trace


apps/s_client.c:346:9: Call
344.       int ret =
345.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
346.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) &&
               ^
347.           p != NULL && BN_rshift1(p, N) &&
348.           /* p = (N-1)/2 */

crypto/bn/bn_prime.c:296:12: Call
  294.                      BN_GENCB *cb)
  295.   {
  296.       return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                    ^
  297.   }
  298.   

crypto/bn/bn_prime.c:380:13: Call
    378.           /* now 1 <= check < A */
    379.   
    380.           j = witness(check, A, A1, A1_odd, k, ctx, mont);
                       ^
    381.           if (j == -1)
    382.               goto err;

crypto/bn/bn_prime.c:475:10: Call
      473.                      BN_MONT_CTX *mont)
      474.   {
      475.       if (!BN_mod_exp_mont(w, w, a1_odd, a, ctx, mont)) /* w := w^a1_odd mod a */
                      ^
      476.           return -1;
      477.       if (BN_is_one(w))

crypto/bn/bn_exp.c:456:14: Call
        454.   
        455.       if (a->neg || BN_ucmp(a, m) >= 0) {
        456.           if (!BN_nnmod(val[0], a, m, ctx))
                            ^
        457.               goto err;
        458.           aa = val[0];

crypto/bn/bn_mod.c:125:11: Call
          123.        */
          124.   
          125.       if (!(BN_mod(r, m, d, ctx)))
                           ^
          126.           return 0;
          127.       if (!r->neg)

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

apps/s_client.c:347:22: Call
345.           g != NULL && N != NULL && bn_ctx != NULL && BN_is_odd(N) &&
346.           BN_is_prime_ex(N, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) &&
347.           p != NULL && BN_rshift1(p, N) &&
                            ^
348.           /* p = (N-1)/2 */
349.           BN_is_prime_ex(p, SRP_NUMBER_ITERATIONS_FOR_PRIME, bn_ctx, NULL) &&

crypto/bn/bn_shift.c:94:1: Parameter `*r->d`
  92.   }
  93.   
  94. > int BN_rshift1(BIGNUM *r, const BIGNUM *a)
  95.   {
  96.       BN_ULONG *ap, *rp, t, c;

crypto/bn/bn_shift.c:103:9: Call
  101.   
  102.       if (BN_is_zero(a)) {
  103.           BN_zero(r);
                 ^
  104.           return (1);
  105.       }

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
    521.   {
    522.       bn_check_top(a);
    523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    524.           return (0);
    525.       a->neg = 0;

crypto/bn/bn_lib.c:380:1: Parameter `*b->d`
      378.    */
      379.   
      380. > BIGNUM *bn_expand2(BIGNUM *b, int words)
      381.   {
      382.       bn_check_top(b);

crypto/bn/bn_lib.c:385:23: Call
      383.   
      384.       if (words > b->dmax) {
      385.           BN_ULONG *a = bn_expand_internal(b, words);
                                   ^
      386.           if (!a)
      387.               return NULL;

crypto/bn/bn_lib.c:299:1: <Length trace>
297.   /* This is used by bn_expand2() */
298.   /* The caller MUST check that words > b->dmax before calling this */
299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
300.   {
301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:299:1: Parameter `*b->d`
        297.   /* This is used by bn_expand2() */
        298.   /* The caller MUST check that words > b->dmax before calling this */
        299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
        300.   {
        301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:325:5: Assignment
        323.   
        324.   #if 1
        325.       B = b->d;
                   ^
        326.       /* Check if the previous number needs to be copied */
        327.       if (B != NULL) {

crypto/bn/bn_lib.c:342:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_rshift1` 
        340.               a1 = B[1];
        341.               a2 = B[2];
        342.               a3 = B[3];
                                ^
        343.               A[0] = a0;
        344.               A[1] = a1;
