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


crypto/rsa/rsa_chk.c:89:6: Call
87.   	
88.   	/* p prime? */
89.   	r = BN_is_prime_ex(key->p, BN_prime_checks, NULL, cb);
           ^
90.   	if (r != 1)
91.   		{

crypto/bn/bn_prime.c:294:1: Parameter `ctx_passed->stack.depth`
  292.   	}
  293.   
  294. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

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

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   	}
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.   		int do_trial_division, BN_GENCB *cb)
    301.   	{

crypto/rsa/rsa_chk.c:99:6: Call
97.   	
98.   	/* q prime? */
99.   	r = BN_is_prime_ex(key->q, BN_prime_checks, NULL, cb);
            ^
100.   	if (r != 1)
101.   		{

crypto/bn/bn_prime.c:294:1: Parameter `ctx_passed->stack.depth`
  292.   	}
  293.   
  294. > int BN_is_prime_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed, BN_GENCB *cb)
  295.   	{
  296.   	return BN_is_prime_fasttest_ex(a, checks, ctx_passed, 0, cb);

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

crypto/bn/bn_prime.c:299:1: Parameter `ctx_passed->stack.depth`
    297.   	}
    298.   
    299. > int BN_is_prime_fasttest_ex(const BIGNUM *a, int checks, BN_CTX *ctx_passed,
    300.   		int do_trial_division, BN_GENCB *cb)
    301.   	{

crypto/rsa/rsa_chk.c:109:6: Call
107.   	
108.   	/* n = p*q? */
109.   	r = BN_mul(i, key->p, key->q, ctx);
            ^
110.   	if (!r) { ret = -1; goto err; }
111.   	

crypto/bn/bn_mul.c:898:1: Parameter `ctx->stack.depth`
  896.   #endif /* BN_RECURSION */
  897.   
  898. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  899.   	{
  900.   	int ret=0;

crypto/bn/bn_mul.c:925:2: Call
  923.   	top=al+bl;
  924.   
  925.   	BN_CTX_start(ctx);
          ^
  926.   	if ((r == a) || (r == b))
  927.   		{

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

crypto/bn/bn_mul.c:1051:2: Call
  1049.   err:
  1050.   	bn_check_top(r);
  1051.   	BN_CTX_end(ctx);
           ^
  1052.   	return(ret);
  1053.   	}

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

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

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

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

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