crypto/bn/bn_gf2m.c:749: 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:745:10: Call
743.   
744.       /* r := 1/(a * b) */
745.       if (!BN_GF2m_mod_inv_vartime(r, r, p, ctx))
                ^
746.           goto err;
747.   

crypto/bn/bn_gf2m.c:715:5: Call
  713.       bn_correct_top(v);
  714.   # endif
  715.       BN_CTX_end(ctx);
             ^
  716.       return ret;
  717.   }

crypto/bn/bn_ctx.c:185:1: Parameter `ctx->pool.used`
    183.   }
    184.   
    185. > void BN_CTX_end(BN_CTX *ctx)
    186.   {
    187.       if (ctx == NULL)

crypto/bn/bn_gf2m.c:749:10: Call
747.   
748.       /* r := b/(a * b) = 1/a */
749.       if (!BN_GF2m_mod_mul(r, r, b, p, ctx))
                ^
750.           goto err;
751.   

crypto/bn/bn_gf2m.c:465:1: Parameter `ctx->pool.used`
  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.   {

crypto/bn/bn_gf2m.c:481:11: Call
  479.           goto err;
  480.       }
  481.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                   ^
  482.       bn_check_top(r);
  483.    err:

crypto/bn/bn_gf2m.c:410:1: Parameter `ctx->pool.used`
    408.    * the result in r.  r could be a or b; a could be b.
    409.    */
    410. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    411.                           const int p[], BN_CTX *ctx)
    412.   {

crypto/bn/bn_gf2m.c:421:16: Call
    419.   
    420.       if (a == b) {
    421.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                          ^
    422.       }
    423.   

crypto/bn/bn_gf2m.c:489:1: Parameter `ctx->pool.used`
      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:497:14: Call
      495.       bn_check_top(a);
      496.       BN_CTX_start(ctx);
      497.       if ((s = BN_CTX_get(ctx)) == NULL)
                          ^
      498.           goto err;
      499.       if (!bn_wexpand(s, 2 * a->top))

crypto/bn/bn_ctx.c:204:1: Parameter `ctx->pool.used`
        202.   }
        203.   
        204. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
        205.   {
        206.       BIGNUM *ret;

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->pool.used`
        183.   }
        184.   
        185. > void BN_CTX_end(BN_CTX *ctx)
        186.   {
        187.       if (ctx == NULL)

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

crypto/bn/bn_ctx.c:340:1: <LHS trace>
338.   }
339.   
340. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
341.   {
342.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:340:1: Parameter `p->used`
          338.   }
          339.   
          340. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
          341.   {
          342.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

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