crypto/rsa/rsa_crpt.c:151: error: INTEGER_OVERFLOW_L2
  ([0, 4+max(0, `ctx->stack.depth`)] - 1):unsigned32 by call to `BN_mod_inverse`.
Showing all 25 steps of the trace


crypto/rsa/rsa_crpt.c:132:1: Parameter `ctx->stack.depth`
130.   	}
131.   
132. > static BIGNUM *rsa_get_public_exp(const BIGNUM *d, const BIGNUM *p,
133.   	const BIGNUM *q, BN_CTX *ctx)
134.   {

crypto/rsa/rsa_crpt.c:140:2: Call
138.   		return NULL;
139.   
140.   	BN_CTX_start(ctx);
        ^
141.   	r0 = BN_CTX_get(ctx);
142.   	r1 = 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/rsa/rsa_crpt.c:149:7: Call
147.   	if (!BN_sub(r1, p, BN_value_one())) goto err;
148.   	if (!BN_sub(r2, q, BN_value_one())) goto err;
149.   	if (!BN_mul(r0, r1, r2, ctx)) goto err;
             ^
150.   
151.   	ret = BN_mod_inverse(NULL, d, r0, 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_crpt.c:151:8: Call
149.   	if (!BN_mul(r0, r1, r2, ctx)) goto err;
150.   
151.   	ret = BN_mod_inverse(NULL, d, r0, ctx);
              ^
152.   err:
153.   	BN_CTX_end(ctx);

crypto/bn/bn_gcd.c:211:1: Parameter `ctx->stack.depth`
  209.           const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx);
  210.   
  211. > BIGNUM *BN_mod_inverse(BIGNUM *in,
  212.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
  213.   	{

crypto/bn/bn_gcd.c:216:7: Call
  214.   	BIGNUM *rv;
  215.   	int noinv;
  216.   	rv = int_bn_mod_inverse(in, a, n, ctx, &noinv);
               ^
  217.   	if (noinv)
  218.   		BNerr(BN_F_BN_MOD_INVERSE,BN_R_NO_INVERSE);

crypto/bn/bn_gcd.c:222:1: Parameter `ctx->stack.depth`
    220.   	}
    221.   
    222. > BIGNUM *int_bn_mod_inverse(BIGNUM *in,
    223.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx, int *pnoinv)
    224.   	{

crypto/bn/bn_gcd.c:234:10: Call
    232.   	if ((BN_get_flags(a, BN_FLG_CONSTTIME) != 0) || (BN_get_flags(n, BN_FLG_CONSTTIME) != 0))
    233.   		{
    234.   		return BN_mod_inverse_no_branch(in, a, n, ctx);
                    ^
    235.   		}
    236.   

crypto/bn/bn_gcd.c:524:1: Parameter `ctx->stack.depth`
      522.    * It does not contain branches that may leak sensitive information.
      523.    */
      524. > static BIGNUM *BN_mod_inverse_no_branch(BIGNUM *in,
      525.   	const BIGNUM *a, const BIGNUM *n, BN_CTX *ctx)
      526.   	{

crypto/bn/bn_gcd.c:536:2: Call
      534.   	bn_check_top(n);
      535.   
      536.   	BN_CTX_start(ctx);
              ^
      537.   	A = BN_CTX_get(ctx);
      538.   	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:565:8: Call
      563.   		pB = &local_B;
      564.   		BN_with_flags(pB, B, BN_FLG_CONSTTIME);	
      565.   		if (!BN_nnmod(B, pB, A, ctx)) goto err;
                    ^
      566.   		}
      567.   	sign = -1;

crypto/bn/bn_mod.c:129:1: Parameter `ctx->stack.depth`
        127.   
        128.   
        129. > int BN_nnmod(BIGNUM *r, const BIGNUM *m, const BIGNUM *d, BN_CTX *ctx)
        130.   	{
        131.   	/* like BN_mod, but returns non-negative remainder

crypto/bn/bn_mod.c:134:8: Call
        132.   	 * (i.e.,  0 <= r < |d|  always holds) */
        133.   
        134.   	if (!(BN_mod(r,m,d,ctx)))
                      ^
        135.   		return 0;
        136.   	if (!r->neg)

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/bn/bn_div.c:228:2: Call
          226.   		}
          227.   
          228.   	BN_CTX_start(ctx);
                  ^
          229.   	tmp=BN_CTX_get(ctx);
          230.   	snum=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_div.c:443:2: Call
          441.   		}
          442.   	if (no_branch)	bn_correct_top(res);
          443.   	BN_CTX_end(ctx);
                  ^
          444.   	return(1);
          445.   err:

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, 4+max(0, ctx->stack.depth)] - 1):unsigned32 by call to `BN_mod_inverse` 
              353.   static unsigned int BN_STACK_pop(BN_STACK *st)
              354.   	{
              355.   	return st->indexes[--(st->depth)];
                             ^
              356.   	}
              357.   
