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


crypto/bn/bntest.c:1627:1: Parameter `ctx->stack.depth`
1625.   }
1626.   
1627. > int test_gf2m_mod_solve_quad(BIO *bp, BN_CTX *ctx)
1628.   {
1629.       BIGNUM *a, *b[2], *c, *d, *e;

crypto/bn/bntest.c:1647:17: Call
1645.           BN_bntest_rand(a, 512, 0, 0);
1646.           for (j = 0; j < 2; j++) {
1647.               t = BN_GF2m_mod_solve_quad(c, a, b[j], ctx);
                        ^
1648.               if (t) {
1649.                   s++;

crypto/bn/bn_gf2m.c:1213:1: Parameter `ctx->stack.depth`
  1211.    * for best performance, use the BN_GF2m_mod_solve_quad_arr function.
  1212.    */
  1213. > int BN_GF2m_mod_solve_quad(BIGNUM *r, const BIGNUM *a, const BIGNUM *p,
  1214.                              BN_CTX *ctx)
  1215.   {

crypto/bn/bntest.c:1650:17: Call
1648.               if (t) {
1649.                   s++;
1650.                   BN_GF2m_mod_sqr(d, c, b[j], ctx);
                        ^
1651.                   BN_GF2m_add(d, c, d);
1652.                   BN_GF2m_mod(e, a, b[j]);

crypto/bn/bn_gf2m.c:605:1: Parameter `ctx->stack.depth`
  603.    * use the BN_GF2m_mod_sqr_arr function.
  604.    */
  605. > int BN_GF2m_mod_sqr(BIGNUM *r, const BIGNUM *a, const BIGNUM *p, BN_CTX *ctx)
  606.   {
  607.       int ret = 0;

crypto/bn/bn_gf2m.c:620:11: Call
  618.           goto err;
  619.       }
  620.       ret = BN_GF2m_mod_sqr_arr(r, a, arr, ctx);
                   ^
  621.       bn_check_top(r);
  622.    err:

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

crypto/bn/bn_gf2m.c:577:5: Call
    575.   
    576.       bn_check_top(a);
    577.       BN_CTX_start(ctx);
               ^
    578.       if ((s = BN_CTX_get(ctx)) == NULL)
    579.           return 0;

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

crypto/bn/bn_gf2m.c:595:5: Call
    593.       ret = 1;
    594.    err:
    595.       BN_CTX_end(ctx);
               ^
    596.       return ret;
    597.   }

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

crypto/bn/bn_ctx.c:273:27: Call
      271.           ctx->err_stack--;
      272.       else {
      273.           unsigned int fp = BN_STACK_pop(&ctx->stack);
                                       ^
      274.           /* Does this stack frame have anything to release? */
      275.           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:12: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_sqr` 
        351.   static unsigned int BN_STACK_pop(BN_STACK *st)
        352.   {
        353.       return st->indexes[--(st->depth)];
                          ^
        354.   }
        355.   
