crypto/rsa/rsa_chk.c:128: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul`.
Showing all 34 steps of the trace


crypto/rsa/rsa_chk.c:84:6: Call
82.   	
83.   	/* p prime? */
84.   	r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, NULL);
           ^
85.   	if (r != 1)
86.   		{

crypto/bn/bn_prime.c:251:1: Parameter `ctx_passed->stack.depth`
  249.   	}
  250.   
  251. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:253:9: Call
  251.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  254.   	}
  255.   

crypto/bn/bn_prime.c:256:1: Parameter `ctx_passed->stack.depth`
    254.   	}
    255.   
    256. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    257.   		int do_trial_division, BN_GENCB *cb)
    258.   	{

crypto/rsa/rsa_chk.c:94:6: Call
92.   	
93.   	/* q prime? */
94.   	r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, NULL);
           ^
95.   	if (r != 1)
96.   		{

crypto/bn/bn_prime.c:251:1: Parameter `ctx_passed->stack.depth`
  249.   	}
  250.   
  251. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

crypto/bn/bn_prime.c:253:9: Call
  251.   int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  252.   	{
  253.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);
                 ^
  254.   	}
  255.   

crypto/bn/bn_prime.c:256:1: Parameter `ctx_passed->stack.depth`
    254.   	}
    255.   
    256. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    257.   		int do_trial_division, BN_GENCB *cb)
    258.   	{

crypto/rsa/rsa_chk.c:104:6: Call
102.   	
103.   	/* n = p*q? */
104.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
105.   	if (!r) { ret = -1; goto err; }
106.   	

crypto/bn/bn_mul.c:943:1: Parameter `ctx->stack.depth`
  941.   #endif /* BN_RECURSION */
  942.   
  943. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  944.   	{
  945.   	int ret=0;

crypto/rsa/rsa_chk.c:121:6: Call
119.   
120.   	/* now compute k = lcm(i,j) */
121.   	r = BN_mul(l, i, j, ctx);
            ^
122.   	if (!r) { ret = -1; goto err; }
123.   	r = BN_gcd(m, i, j, ctx);

crypto/bn/bn_mul.c:943:1: Parameter `ctx->stack.depth`
  941.   #endif /* BN_RECURSION */
  942.   
  943. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  944.   	{
  945.   	int ret=0;

crypto/rsa/rsa_chk.c:123:6: Call
121.   	r = BN_mul(l, i, j, ctx);
122.   	if (!r) { ret = -1; goto err; }
123.   	r = BN_gcd(m, i, j, ctx);
            ^
124.   	if (!r) { ret = -1; goto err; }
125.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */

crypto/bn/bn_gcd.c:119:1: Parameter `ctx->stack.depth`
  117.   static BIGNUM *euclid(BIGNUM *a, BIGNUM *b);
  118.   
  119. > int BN_gcd(BIGNUM *r, const BIGNUM *in_a, const BIGNUM *in_b, BN_CTX *ctx)
  120.   	{
  121.   	BIGNUM *a,*b,*t;

crypto/bn/bn_gcd.c:127:2: Call
  125.   	bn_check_top(in_b);
  126.   
  127.   	BN_CTX_start(ctx);
          ^
  128.   	a = BN_CTX_get(ctx);
  129.   	b = BN_CTX_get(ctx);

crypto/bn/bn_ctx.c:257:1: Parameter `ctx->stack.depth`
    255.   	}
    256.   
    257. > void BN_CTX_start(BN_CTX *ctx)
    258.   	{
    259.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_gcd.c:144:2: Call
  142.   	ret=1;
  143.   err:
  144.   	BN_CTX_end(ctx);
          ^
  145.   	bn_check_top(r);
  146.   	return(ret);

crypto/bn/bn_ctx.c:272:1: Parameter `ctx->stack.depth`
    270.   	}
    271.   
    272. > void BN_CTX_end(BN_CTX *ctx)
    273.   	{
    274.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/rsa/rsa_chk.c:125:6: Call
123.   	r = BN_gcd(m, i, j, ctx);
124.   	if (!r) { ret = -1; goto err; }
125.   	r = BN_div(k, NULL, l, m, ctx); /* remainder is 0 */
            ^
126.   	if (!r) { ret = -1; goto err; }
127.   

crypto/bn/bn_div.c:183:1: Parameter `ctx->stack.depth`
  181.    * If 'dv' or 'rm' is NULL, the respective value is not returned.
  182.    */
  183. > int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor,
  184.   	   BN_CTX *ctx)
  185.   	{

crypto/rsa/rsa_chk.c:128:6: Call
126.   	if (!r) { ret = -1; goto err; }
127.   
128.   	r = BN_mod_mul(i, key->d, key->e, k, ctx);
            ^
129.   	if (!r) { ret = -1; goto err; }
130.   

crypto/bn/bn_mod.c:180:1: Parameter `ctx->stack.depth`
  178.   
  179.   /* slow but works */
  180. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  181.   	BN_CTX *ctx)
  182.   	{

crypto/bn/bn_mod.c:190:2: Call
  188.   	bn_check_top(m);
  189.   
  190.   	BN_CTX_start(ctx);
          ^
  191.   	if ((t = BN_CTX_get(ctx)) == NULL) goto err;
  192.   	if (a == b)

crypto/bn/bn_ctx.c:257:1: Parameter `ctx->stack.depth`
    255.   	}
    256.   
    257. > void BN_CTX_start(BN_CTX *ctx)
    258.   	{
    259.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mod.c:195:10: Call
  193.   		{ if (!BN_sqr(t,a,ctx)) goto err; }
  194.   	else
  195.   		{ if (!BN_mul(t,a,b,ctx)) goto err; }
                  ^
  196.   	if (!BN_nnmod(r,t,m,ctx)) goto err;
  197.   	bn_check_top(r);

crypto/bn/bn_mul.c:943:1: Parameter `ctx->stack.depth`
    941.   #endif /* BN_RECURSION */
    942.   
    943. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
    944.   	{
    945.   	int ret=0;

crypto/bn/bn_mul.c:974:2: Call
    972.   	top=al+bl;
    973.   
    974.   	BN_CTX_start(ctx);
            ^
    975.   	if ((r == a) || (r == b))
    976.   		{

crypto/bn/bn_ctx.c:257:1: Parameter `ctx->stack.depth`
      255.   	}
      256.   
      257. > void BN_CTX_start(BN_CTX *ctx)
      258.   	{
      259.   	CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_mul.c:1100:2: Call
    1098.   err:
    1099.   	bn_check_top(r);
    1100.   	BN_CTX_end(ctx);
             ^
    1101.   	return(ret);
    1102.   	}

crypto/bn/bn_ctx.c:272:1: Parameter `ctx->stack.depth`
      270.   	}
      271.   
      272. > void BN_CTX_end(BN_CTX *ctx)
      273.   	{
      274.   	CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:279:21: Call
      277.   	else
      278.   		{
      279.   		unsigned int fp = BN_STACK_pop(&ctx->stack);
                                 ^
      280.   		/* Does this stack frame have anything to release? */
      281.   		if(fp < ctx->used)

crypto/bn/bn_ctx.c:353:1: <LHS trace>
351.   	}
352.   
353. > static unsigned int BN_STACK_pop(BN_STACK *st)
354.   	{
355.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:353:1: Parameter `st->depth`
        351.   	}
        352.   
        353. > static unsigned int BN_STACK_pop(BN_STACK *st)
        354.   	{
        355.   	return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:355:9: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_mod_mul` 
        353.   static unsigned int BN_STACK_pop(BN_STACK *st)
        354.   	{
        355.   	return st->indexes[--(st->depth)];
                       ^
        356.   	}
        357.   
