crypto/bn/bn_gf2m.c:755: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_mul_arr`.
Showing all 19 steps of the trace


crypto/bn/bn_gf2m.c:730:1: Parameter `ctx->stack.depth`
728.    * Uses simple square-and-multiply algorithm A.5.1 from IEEE P1363.
729.    */
730. > int	BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const int p[], BN_CTX *ctx)
731.   	{
732.   	int ret = 0, i, n;

crypto/bn/bn_gf2m.c:744:2: Call
742.   		return (BN_copy(r, a) != NULL);
743.   
744.   	BN_CTX_start(ctx);
        ^
745.   	if ((u = BN_CTX_get(ctx)) == NULL) goto err;
746.   	

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

crypto/bn/bn_gf2m.c:752:8: Call
750.   	for (i = n - 1; i >= 0; i--)
751.   		{
752.   		if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx)) goto err;
              ^
753.   		if (BN_is_bit_set(b, i))
754.   			{

crypto/bn/bn_gf2m.c:457:1: Parameter `ctx->stack.depth`
  455.   
  456.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
  457. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
  458.   	{
  459.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:463:2: Call
  461.   
  462.   	bn_check_top(a);
  463.   	BN_CTX_start(ctx);
          ^
  464.   	if ((s = BN_CTX_get(ctx)) == NULL) return 0;
  465.   	if (!bn_wexpand(s, 2 * a->top)) goto err;

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

crypto/bn/bn_gf2m.c:755:9: Call
753.   		if (BN_is_bit_set(b, i))
754.   			{
755.   			if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx)) goto err;
               ^
756.   			}
757.   		}

crypto/bn/bn_gf2m.c:380:1: Parameter `ctx->stack.depth`
  378.    * the result in r.  r could be a or b; a could be b.
  379.    */
  380. > int	BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const int p[], BN_CTX *ctx)
  381.   	{
  382.   	int zlen, i, j, k, ret = 0;

crypto/bn/bn_gf2m.c:391:10: Call
  389.   	if (a == b)
  390.   		{
  391.   		return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                  ^
  392.   		}
  393.   

crypto/bn/bn_gf2m.c:457:1: Parameter `ctx->stack.depth`
    455.   
    456.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    457. > int	BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[], BN_CTX *ctx)
    458.   	{
    459.   	int i, ret = 0;

crypto/bn/bn_gf2m.c:463:2: Call
    461.   
    462.   	bn_check_top(a);
    463.   	BN_CTX_start(ctx);
            ^
    464.   	if ((s = BN_CTX_get(ctx)) == NULL) return 0;
    465.   	if (!bn_wexpand(s, 2 * a->top)) goto err;

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

crypto/bn/bn_gf2m.c:479:2: Call
    477.   	ret = 1;
    478.   err:
    479.   	BN_CTX_end(ctx);
            ^
    480.   	return ret;
    481.   	}

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

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

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

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

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