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


crypto/bn/bn_gf2m.c:846:10: Call
844.           goto err;
845.   
846.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
                ^
847.           goto err;
848.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))

crypto/bn/bn_gf2m.c:795:5: Call
  793.       bn_correct_top(v);
  794.   # endif
  795.       BN_CTX_end(ctx);
             ^
  796.       return ret;
  797.   }

crypto/bn/bn_ctx.c:250:1: Parameter `ctx->pool.used`
    248.   }
    249.   
    250. > void BN_CTX_end(BN_CTX *ctx)
    251.   {
    252.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_gf2m.c:848:10: Call
846.       if (!BN_GF2m_mod_inv(xinv, x, p, ctx))
847.           goto err;
848.       if (!BN_GF2m_mod_mul(r, y, xinv, p, ctx))
                ^
849.           goto err;
850.       bn_check_top(r);

crypto/bn/bn_gf2m.c:544:1: Parameter `ctx->pool.used`
  542.    * BN_GF2m_mod_mul_arr function.
  543.    */
  544. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  545.                       const BIGNUM *p, BN_CTX *ctx)
  546.   {

crypto/bn/bn_gf2m.c:560:11: Call
  558.           goto err;
  559.       }
  560.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                   ^
  561.       bn_check_top(r);
  562.    err:

crypto/bn/bn_gf2m.c:489:1: Parameter `ctx->pool.used`
    487.    * the result in r.  r could be a or b; a could be b.
    488.    */
    489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    490.                           const int p[], BN_CTX *ctx)
    491.   {

crypto/bn/bn_gf2m.c:500:16: Call
    498.   
    499.       if (a == b) {
    500.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                          ^
    501.       }
    502.   

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

crypto/bn/bn_gf2m.c:576:14: Call
      574.       bn_check_top(a);
      575.       BN_CTX_start(ctx);
      576.       if ((s = BN_CTX_get(ctx)) == NULL)
                          ^
      577.           goto err;
      578.       if (!bn_wexpand(s, 2 * a->top))

crypto/bn/bn_ctx.c:267:1: Parameter `ctx->pool.used`
        265.   }
        266.   
        267. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
        268.   {
        269.       BIGNUM *ret;

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

crypto/bn/bn_ctx.c:250:1: Parameter `ctx->pool.used`
        248.   }
        249.   
        250. > void BN_CTX_end(BN_CTX *ctx)
        251.   {
        252.       CTXDBG_ENTRY("BN_CTX_end", ctx);

crypto/bn/bn_ctx.c:259:13: Call
        257.           /* Does this stack frame have anything to release? */
        258.           if (fp < ctx->used)
        259.               BN_POOL_release(&ctx->pool, ctx->used - fp);
                           ^
        260.           ctx->used = fp;
        261.           /* Unjam "too_many" in case "get" had failed */

crypto/bn/bn_ctx.c:395:1: <LHS trace>
393.   }
394.   
395. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
396.   {
397.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:395:1: Parameter `p->used`
          393.   }
          394.   
          395. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
          396.   {
          397.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:397:5: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_GF2m_mod_mul` 
          395.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
          396.   {
          397.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
                     ^
          398.   
          399.       p->used -= num;
