crypto/rsa/rsa_sp800_56b_check.c:377: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `rsa_check_crt_components`.
Showing all 36 steps of the trace


crypto/rsa/rsa_sp800_56b_check.c:360:5: Call
358.           return 0;
359.   
360.       BN_CTX_start(ctx);
           ^
361.       r = BN_CTX_get(ctx);
362.       if (r == NULL || !BN_mul(r, rsa->p, rsa->q, ctx))

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
  192.   }
  193.   
  194. > void BN_CTX_start(BN_CTX *ctx)
  195.   {
  196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/rsa/rsa_sp800_56b_check.c:362:23: Call
360.       BN_CTX_start(ctx);
361.       r = BN_CTX_get(ctx);
362.       if (r == NULL || !BN_mul(r, rsa->p, rsa->q, ctx))
                             ^
363.           goto err;
364.       /* (Step 4.c): Check n = pq */

crypto/bn/bn_mul.c:497:1: Parameter `ctx->stack.depth`
  495.   #endif                          /* BN_RECURSION */
  496.   
  497. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = bn_mul_fixed_top(r, a, b, ctx);

crypto/bn/bn_mul.c:499:15: Call
  497.   int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  498.   {
  499.       int ret = bn_mul_fixed_top(r, a, b, ctx);
                       ^
  500.   
  501.       bn_correct_top(r);

crypto/bn/bn_mul.c:507:1: Parameter `ctx->stack.depth`
    505.   }
    506.   
    507. > int bn_mul_fixed_top(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    508.   {
    509.       int ret = 0;

crypto/rsa/rsa_sp800_56b_check.c:371:11: Call
369.   
370.       /* (Step 5): check prime factors p & q */
371.       ret = rsa_check_prime_factor(rsa->p, rsa->e, nbits, ctx)
                 ^
372.             && rsa_check_prime_factor(rsa->q, rsa->e, nbits, ctx)
373.             && (rsa_check_pminusq_diff(r, rsa->p, rsa->q, nbits) > 0)

crypto/rsa/rsa_sp800_56b_check.c:124:1: Parameter `ctx->stack.depth`
  122.    * See SP800-5bBr1 6.4.1.2.3 Step 5 (a to d) & (e to h).
  123.    */
  124. > int rsa_check_prime_factor(BIGNUM *p, BIGNUM *e, int nbits, BN_CTX *ctx)
  125.   {
  126.       int checks = bn_rsa_fips186_4_prime_MR_min_checks(nbits);

crypto/rsa/rsa_sp800_56b_check.c:131:9: Call
  129.   
  130.       /* (Steps 5 a-b) prime test */
  131.       if (BN_is_prime_fasttest_ex(p, checks, ctx, 1, NULL) != 1
                 ^
  132.               /* (Step 5c) (√2)(2^(nbits/2 - 1) <= p <= 2^(nbits/2 - 1) */
  133.               || rsa_check_prime_factor_range(p, nbits, ctx) != 1)

crypto/bn/bn_prime.c:203:1: Parameter `ctx->stack.depth`
    201.   
    202.   /* See FIPS 186-4 C.3.1 Miller Rabin Probabilistic Primality Test. */
    203. > int BN_is_prime_fasttest_ex(const BIGNUM *w, int checks, BN_CTX *ctx,
    204.                               int do_trial_division, BN_GENCB *cb)
    205.   {

crypto/rsa/rsa_sp800_56b_check.c:372:14: Call
370.       /* (Step 5): check prime factors p & q */
371.       ret = rsa_check_prime_factor(rsa->p, rsa->e, nbits, ctx)
372.             && rsa_check_prime_factor(rsa->q, rsa->e, nbits, ctx)
                    ^
373.             && (rsa_check_pminusq_diff(r, rsa->p, rsa->q, nbits) > 0)
374.             /* (Step 6): Check the private exponent d */

crypto/rsa/rsa_sp800_56b_check.c:124:1: Parameter `ctx->stack.depth`
  122.    * See SP800-5bBr1 6.4.1.2.3 Step 5 (a to d) & (e to h).
  123.    */
  124. > int rsa_check_prime_factor(BIGNUM *p, BIGNUM *e, int nbits, BN_CTX *ctx)
  125.   {
  126.       int checks = bn_rsa_fips186_4_prime_MR_min_checks(nbits);

crypto/rsa/rsa_sp800_56b_check.c:131:9: Call
  129.   
  130.       /* (Steps 5 a-b) prime test */
  131.       if (BN_is_prime_fasttest_ex(p, checks, ctx, 1, NULL) != 1
                 ^
  132.               /* (Step 5c) (√2)(2^(nbits/2 - 1) <= p <= 2^(nbits/2 - 1) */
  133.               || rsa_check_prime_factor_range(p, nbits, ctx) != 1)

crypto/bn/bn_prime.c:203:1: Parameter `ctx->stack.depth`
    201.   
    202.   /* See FIPS 186-4 C.3.1 Miller Rabin Probabilistic Primality Test. */
    203. > int BN_is_prime_fasttest_ex(const BIGNUM *w, int checks, BN_CTX *ctx,
    204.                               int do_trial_division, BN_GENCB *cb)
    205.   {

crypto/rsa/rsa_sp800_56b_check.c:375:14: Call
373.             && (rsa_check_pminusq_diff(r, rsa->p, rsa->q, nbits) > 0)
374.             /* (Step 6): Check the private exponent d */
375.             && rsa_check_private_exponent(rsa, nbits, ctx)
                    ^
376.             /* 6.4.1.2.3 (Step 7): Check the CRT components */
377.             && rsa_check_crt_components(rsa, ctx);

crypto/rsa/rsa_sp800_56b_check.c:157:1: Parameter `ctx->stack.depth`
  155.    *     (Step 6b) 1 = (d*e) mod LCM(p–1, q–1)
  156.    */
  157. > int rsa_check_private_exponent(const RSA *rsa, int nbits, BN_CTX *ctx)
  158.   {
  159.       int ret;

crypto/rsa/rsa_sp800_56b_check.c:377:14: Call
375.             && rsa_check_private_exponent(rsa, nbits, ctx)
376.             /* 6.4.1.2.3 (Step 7): Check the CRT components */
377.             && rsa_check_crt_components(rsa, ctx);
                    ^
378.       if (ret != 1)
379.           RSAerr(RSA_F_RSA_SP800_56B_CHECK_KEYPAIR, RSA_R_INVALID_KEYPAIR);

crypto/rsa/rsa_sp800_56b_check.c:24:1: Parameter `ctx->stack.depth`
  22.    *   6.4.1.3.3: rsakpv2-crt Step 7
  23.    */
  24. > int rsa_check_crt_components(const RSA *rsa, BN_CTX *ctx)
  25.   {
  26.       int ret = 0;

crypto/rsa/rsa_sp800_56b_check.c:36:5: Call
  34.       }
  35.   
  36.       BN_CTX_start(ctx);
            ^
  37.       r = BN_CTX_get(ctx);
  38.       p1 = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
    192.   }
    193.   
    194. > void BN_CTX_start(BN_CTX *ctx)
    195.   {
    196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/rsa/rsa_sp800_56b_check.c:57:14: Call
  55.             && (BN_cmp(rsa->iqmp, rsa->p) < 0)
  56.             /* (d) 1 = (dP . e) mod (p - 1)*/
  57.             && BN_mod_mul(r, rsa->dmp1, rsa->e, p1, ctx)
                     ^
  58.             && BN_is_one(r)
  59.             /* (e) 1 = (dQ . e) mod (q - 1) */

crypto/bn/bn_mod.c:193:1: Parameter `ctx->stack.depth`
    191.   
    192.   /* slow but works */
    193. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
    194.                  BN_CTX *ctx)
    195.   {

crypto/bn/bn_mod.c:203:5: Call
    201.       bn_check_top(m);
    202.   
    203.       BN_CTX_start(ctx);
               ^
    204.       if ((t = BN_CTX_get(ctx)) == NULL)
    205.           goto err;

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
      192.   }
      193.   
      194. > void BN_CTX_start(BN_CTX *ctx)
      195.   {
      196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_mod.c:207:14: Call
    205.           goto err;
    206.       if (a == b) {
    207.           if (!BN_sqr(t, a, ctx))
                        ^
    208.               goto err;
    209.       } else {

crypto/bn/bn_sqr.c:17:1: Parameter `ctx->stack.depth`
      15.    * I've just gone over this and it is now %20 faster on x86 - eay - 27 Jun 96
      16.    */
      17. > int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      18.   {
      19.       int ret = bn_sqr_fixed_top(r, a, ctx);

crypto/bn/bn_sqr.c:19:15: Call
      17.   int BN_sqr(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
      18.   {
      19.       int ret = bn_sqr_fixed_top(r, a, ctx);
                          ^
      20.   
      21.       bn_correct_top(r);

crypto/bn/bn_sqr.c:27:1: Parameter `ctx->stack.depth`
        25.   }
        26.   
        27. > int bn_sqr_fixed_top(BIGNUM *r, const BIGNUM *a, BN_CTX *ctx)
        28.   {
        29.       int max, al;

crypto/bn/bn_sqr.c:42:5: Call
        40.       }
        41.   
        42.       BN_CTX_start(ctx);
                  ^
        43.       rr = (a != r) ? r : BN_CTX_get(ctx);
        44.       tmp = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:194:1: Parameter `ctx->stack.depth`
          192.   }
          193.   
          194. > void BN_CTX_start(BN_CTX *ctx)
          195.   {
          196.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_sqr.c:104:5: Call
        102.       bn_check_top(rr);
        103.       bn_check_top(tmp);
        104.       BN_CTX_end(ctx);
                   ^
        105.       return ret;
        106.   }

crypto/bn/bn_ctx.c:208:1: Parameter `ctx->stack.depth`
          206.   }
          207.   
          208. > void BN_CTX_end(BN_CTX *ctx)
          209.   {
          210.       if (ctx == NULL)

crypto/bn/bn_ctx.c:216:27: Call
          214.           ctx->err_stack--;
          215.       else {
          216.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                           ^
          217.           /* Does this stack frame have anything to release? */
          218.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:298:1: <LHS trace>
296.   }
297.   
298. > static unsigned int BN_STACK_pop(BN_STACK *st)
299.   {
300.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:298:1: Parameter `st->depth`
            296.   }
            297.   
            298. > static unsigned int BN_STACK_pop(BN_STACK *st)
            299.   {
            300.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:300:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `rsa_check_crt_components` 
            298.   static unsigned int BN_STACK_pop(BN_STACK *st)
            299.   {
            300.       return st->indexes[--(st->depth)];
                              ^
            301.   }
            302.   
