test/bntest.c:726: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqr`.
Showing all 16 steps of the trace


test/bntest.c:726:13: Call
724.           BN_bntest_rand(a, 1024, 0, 0);
725.           for (j = 0; j < 2; j++) {
726.               BN_GF2m_mod_sqr(c, a, b[j], ctx);
                   ^
727.               BN_copy(d, a);
728.               BN_GF2m_mod_mul(d, a, d, b[j], ctx);

crypto/bn/bn_gf2m.c:524:1: Parameter `ctx->stack.depth`
  522.    * use the BN_GF2m_mod_sqr_arr function.
  523.    */
  524. > int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  525.   {
  526.       int ret = 0;

test/bntest.c:728:13: Call
726.               BN_GF2m_mod_sqr(c, a, b[j], ctx);
727.               BN_copy(d, a);
728.               BN_GF2m_mod_mul(d, a, d, b[j], ctx);
                   ^
729.               BN_GF2m_add(d, c, d);
730.               /* Test that a*a = a^2. */

crypto/bn/bn_gf2m.c:465:1: Parameter `ctx->stack.depth`
  463.    * BN_GF2m_mod_mul_arr function.
  464.    */
  465. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  466.                       const BIGNUM *p, BN_CTX *ctx)
  467.   {

test/bntest.c:726:13: Call
724.           BN_bntest_rand(a, 1024, 0, 0);
725.           for (j = 0; j < 2; j++) {
726.               BN_GF2m_mod_sqr(c, a, b[j], ctx);
                   ^
727.               BN_copy(d, a);
728.               BN_GF2m_mod_mul(d, a, d, b[j], ctx);

crypto/bn/bn_gf2m.c:524:1: Parameter `ctx->stack.depth`
  522.    * use the BN_GF2m_mod_sqr_arr function.
  523.    */
  524. > int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  525.   {
  526.       int ret = 0;

crypto/bn/bn_gf2m.c:539:11: Call
  537.           goto err;
  538.       }
  539.       ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
                   ^
  540.       bn_check_top(r);
  541.    err:

crypto/bn/bn_gf2m.c:489:1: Parameter `ctx->stack.depth`
    487.   
    488.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    489. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
    490.                           BN_CTX *ctx)
    491.   {

crypto/bn/bn_gf2m.c:496:5: Call
    494.   
    495.       bn_check_top(a);
    496.       BN_CTX_start(ctx);
               ^
    497.       if ((s = BN_CTX_get(ctx)) == NULL)
    498.           goto err;

crypto/bn/bn_ctx.c:171:1: Parameter `ctx->stack.depth`
      169.   }
      170.   
      171. > void BN_CTX_start(BN_CTX *ctx)
      172.   {
      173.       CTXDBG("ENTER BN_CTX_start()", ctx);

crypto/bn/bn_gf2m.c:514:5: Call
    512.       ret = 1;
    513.    err:
    514.       BN_CTX_end(ctx);
               ^
    515.       return ret;
    516.   }

crypto/bn/bn_ctx.c:185:1: Parameter `ctx->stack.depth`
      183.   }
      184.   
      185. > void BN_CTX_end(BN_CTX *ctx)
      186.   {
      187.       CTXDBG("ENTER BN_CTX_end()", ctx);

crypto/bn/bn_ctx.c:191:27: Call
      189.           ctx->err_stack--;
      190.       else {
      191.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      192.           /* Does this stack frame have anything to release? */
      193.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:266:1: <LHS trace>
264.   }
265.   
266. > static unsigned int BN_STACK_pop(BN_STACK *st)
267.   {
268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:266:1: Parameter `st->depth`
        264.   }
        265.   
        266. > static unsigned int BN_STACK_pop(BN_STACK *st)
        267.   {
        268.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:268:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqr` 
        266.   static unsigned int BN_STACK_pop(BN_STACK *st)
        267.   {
        268.       return st->indexes[--(st->depth)];
                          ^
        269.   }
        270.   
