test/bntest.c:2339: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_is_prime_fasttest_ex`.
Showing all 34 steps of the trace


test/bntest.c:2339:21: Call
2337.       for (trial = 0; trial <= 1; ++trial) {
2338.           if (!TEST_true(BN_set_word(r, not_primes[i]))
2339.                   || !TEST_false(BN_is_prime_fasttest_ex(r, 1, ctx, trial, NULL)))
                            ^
2340.               goto err;
2341.       }

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.   {

test/bntest.c:2339:21: Call
2337.       for (trial = 0; trial <= 1; ++trial) {
2338.           if (!TEST_true(BN_set_word(r, not_primes[i]))
2339.                   || !TEST_false(BN_is_prime_fasttest_ex(r, 1, ctx, trial, NULL)))
                            ^
2340.               goto err;
2341.       }

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/bn/bn_prime.c:246:11: Call
  244.   #endif
  245.   
  246.       ret = bn_miller_rabin_is_prime(w, checks, ctx, cb, 0, &status);
                   ^
  247.       if (!ret)
  248.           goto err;

crypto/bn/bn_prime.c:272:1: Parameter `ctx->stack.depth`
    270.    * returns 0 if there was an error, otherwise it returns 1.
    271.    */
    272. > int bn_miller_rabin_is_prime(const BIGNUM *w, int iterations, BN_CTX *ctx,
    273.                                BN_GENCB *cb, int enhanced, int *status)
    274.   {

crypto/bn/bn_prime.c:283:5: Call
    281.           return 0;
    282.   
    283.       BN_CTX_start(ctx);
               ^
    284.       g = BN_CTX_get(ctx);
    285.       w1 = 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_prime.c:315:26: Call
    313.       /* Montgomery setup for computations mod a */
    314.       mont = BN_MONT_CTX_new();
    315.       if (mont == NULL || !BN_MONT_CTX_set(mont, w, ctx))
                                    ^
    316.           goto err;
    317.   

crypto/bn/bn_mont.c:263:1: Parameter `ctx->stack.depth`
      261.   }
      262.   
      263. > int BN_MONT_CTX_set(BN_MONT_CTX *mont, const BIGNUM *mod, BN_CTX *ctx)
      264.   {
      265.       int i, ret = 0;

crypto/bn/bn_mont.c:271:5: Call
      269.           return 0;
      270.   
      271.       BN_CTX_start(ctx);
                 ^
      272.       if ((Ri = BN_CTX_get(ctx)) == NULL)
      273.           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_mont.c:351:19: Call
      349.           if (BN_is_one(&tmod))
      350.               BN_zero(Ri);
      351.           else if ((BN_mod_inverse(Ri, R, &tmod, ctx)) == NULL)
                               ^
      352.               goto err;
      353.           if (!BN_lshift(Ri, Ri, BN_BITS2))

crypto/bn/bn_gcd.c:124:1: Parameter `ctx->stack.depth`
        122.                                           BN_CTX *ctx);
        123.   
        124. > BIGNUM *BN_mod_inverse(BIGNUM *in,
        125.                          const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
        126.   {

crypto/bn/bn_gcd.c:129:10: Call
        127.       BIGNUM *rv;
        128.       int noinv;
        129.       rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
                        ^
        130.       if (noinv)
        131.           BNerr(BN_F_BN_MOD_INVERSE, BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:135:1: Parameter `ctx->stack.depth`
          133.   }
          134.   
          135. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
          136.                              const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx,
          137.                              int *pnoinv)

crypto/bn/bn_gcd.c:155:16: Call
          153.       if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0)
          154.           || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0)) {
          155.           return BN_mod_inverse_no_branch(in, a, n, ctx);
                                ^
          156.       }
          157.   

crypto/bn/bn_gcd.c:458:1: Parameter `ctx->stack.depth`
            456.    * not contain branches that may leak sensitive information.
            457.    */
            458. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
            459.                                           const BIGNUM *a, const BIGNUM *n,
            460.                                           BN_CTX *ctx)

crypto/bn/bn_gcd.c:469:5: Call
            467.       bn_check_top(n);
            468.   
            469.       BN_CTX_start(ctx);
                       ^
            470.       A = BN_CTX_get(ctx);
            471.       B = 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_gcd.c:504:18: Call
            502.               bn_init(&local_B);
            503.               BN_with_flags(&local_B, B, BN_FLG_CONSTTIME);
            504.               if (!BN_nnmod(B, &local_B, A, ctx))
                                    ^
            505.                   goto err;
            506.               /* Ensure local_B goes out of scope before any further use of B */

crypto/bn/bn_mod.c:13:1: Parameter `ctx->stack.depth`
              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:209:1: Parameter `ctx->stack.depth`
                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.   {

crypto/bn/bn_div.c:229:11: Call
                227.       }
                228.   
                229.       ret = bn_div_fixed_top(dv, rm, num, divisor, ctx);
                                 ^
                230.   
                231.       if (ret) {

crypto/bn/bn_div.c:264:1: Parameter `ctx->stack.depth`
                  262.    *       divisor's length is considered public;
                  263.    */
                  264. > int bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num,
                  265.                        const BIGNUM *divisor, BN_CTX *ctx)
                  266.   {

crypto/bn/bn_div.c:280:5: Call
                  278.       bn_check_top(rm);
                  279.   
                  280.       BN_CTX_start(ctx);
                             ^
                  281.       res = (dv == NULL) ? BN_CTX_get(ctx) : dv;
                  282.       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_div.c:450:5: Call
                  448.       if (rm != NULL)
                  449.           bn_rshift_fixed_top(rm, snum, norm_shift);
                  450.       BN_CTX_end(ctx);
                             ^
                  451.       return 1;
                  452.    err:

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 `BN_is_prime_fasttest_ex` 
                      298.   static unsigned int BN_STACK_pop(BN_STACK *st)
                      299.   {
                      300.       return st->indexes[--(st->depth)];
                                        ^
                      301.   }
                      302.   
