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


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

crypto/bn/bn_gf2m.c:806:2: Call
804.   		return (BN_copy(r, a) != NULL);
805.   
806.   	BN_CTX_start(ctx);
        ^
807.   	if ((u = BN_CTX_get(ctx)) == NULL) goto err;
808.   	

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

crypto/bn/bn_gf2m.c:814:8: Call
812.   	for (i = n - 1; i >= 0; i--)
813.   		{
814.   		if (!BN_GF2m_mod_sqr_arr(u, u, p, ctx)) goto err;
              ^
815.   		if (BN_is_bit_set(b, i))
816.   			{

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

crypto/bn/bn_gf2m.c:525:2: Call
  523.   
  524.   	bn_check_top(a);
  525.   	BN_CTX_start(ctx);
          ^
  526.   	if ((s = BN_CTX_get(ctx)) == NULL) return 0;
  527.   	if (!bn_wexpand(s, 2 * a->top)) goto err;

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

crypto/bn/bn_gf2m.c:541:2: Call
  539.   	ret = 1;
  540.   err:
  541.   	BN_CTX_end(ctx);
          ^
  542.   	return ret;
  543.   	}

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_sqr_arr` 
      351.   static unsigned int BN_STACK_pop(BN_STACK *st)
      352.   	{
      353.   	return st->indexes[--(st->depth)];
                     ^
      354.   	}
      355.   
