test/bntest.c:764: 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:761:17: Call
759.           BN_bntest_rand(a, 512, 0, 0);
760.           for (j = 0; j < 2; j++) {
761.               t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx);
                       ^
762.               if (t) {
763.                   s++;

crypto/bn/bn_gf2m.c:1145:1: Parameter `ctx->stack.depth`
  1143.    * for best performance, use the BN_GF2m_mod_solve_quad_arr function.
  1144.    */
  1145. > int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  1146.                              BN_CTX *ctx)
  1147.   {

test/bntest.c:761:17: Call
759.           BN_bntest_rand(a, 512, 0, 0);
760.           for (j = 0; j < 2; j++) {
761.               t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx);
                       ^
762.               if (t) {
763.                   s++;

crypto/bn/bn_gf2m.c:1145:1: Parameter `ctx->stack.depth`
  1143.    * for best performance, use the BN_GF2m_mod_solve_quad_arr function.
  1144.    */
  1145. > int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  1146.                              BN_CTX *ctx)
  1147.   {

test/bntest.c:764:17: Call
762.               if (t) {
763.                   s++;
764.                   BN_GF2m_mod_sqr(d, c, b[j], ctx);
                       ^
765.                   BN_GF2m_add(d, c, d);
766.                   BN_GF2m_mod(e, a, b[j]);

crypto/bn/bn_gf2m.c:532:1: Parameter `ctx->stack.depth`
  530.    * use the BN_GF2m_mod_sqr_arr function.
  531.    */
  532. > int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  533.   {
  534.       int ret = 0;

crypto/bn/bn_gf2m.c:547:11: Call
  545.           goto err;
  546.       }
  547.       ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
                   ^
  548.       bn_check_top(r);
  549.    err:

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

crypto/bn/bn_gf2m.c:504:5: Call
    502.   
    503.       bn_check_top(a);
    504.       BN_CTX_start(ctx);
               ^
    505.       if ((s = BN_CTX_get(ctx)) == NULL)
    506.           goto err;

crypto/bn/bn_ctx.c:181:1: Parameter `ctx->stack.depth`
      179.   }
      180.   
      181. > void BN_CTX_start(BN_CTX *ctx)
      182.   {
      183.       CTXDBG_ENTRY("BN_CTX_start", ctx);

crypto/bn/bn_gf2m.c:522:5: Call
    520.       ret = 1;
    521.    err:
    522.       BN_CTX_end(ctx);
               ^
    523.       return ret;
    524.   }

crypto/bn/bn_ctx.c:195:1: Parameter `ctx->stack.depth`
      193.   }
      194.   
      195. > void BN_CTX_end(BN_CTX *ctx)
      196.   {
      197.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:201:27: Call
      199.           ctx->err_stack--;
      200.       else {
      201.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      202.           /* Does this stack frame have anything to release? */
      203.           if (fp < ctx->used)

crypto/bn/bn_ctx.c:271:1: <LHS trace>
269.   }
270.   
271. > static unsigned int BN_STACK_pop(BN_STACK *st)
272.   {
273.       return st->indexes[--(st->depth)];

crypto/bn/bn_ctx.c:271:1: Parameter `st->depth`
        269.   }
        270.   
        271. > static unsigned int BN_STACK_pop(BN_STACK *st)
        272.   {
        273.       return st->indexes[--(st->depth)];

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