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


crypto/bn/bn_gf2m.c:947:1: Parameter `ctx->pool.used`
945.    * convenience; for best performance, use the BN_GF2m_mod_div function.
946.    */
947. > int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *yy, const BIGNUM *xx,
948.                           const int p[], BN_CTX *ctx)
949.   {

crypto/bn/bn_gf2m.c:957:18: Call
955.   
956.       BN_CTX_start(ctx);
957.       if ((field = BN_CTX_get(ctx)) == NULL)
                        ^
958.           goto err;
959.       if (!BN_GF2m_arr2poly(p, field))

crypto/bn/bn_ctx.c:284:1: Parameter `ctx->pool.used`
  282.   }
  283.   
  284. > BIGNUM *BN_CTX_get(BN_CTX *ctx)
  285.   {
  286.       BIGNUM *ret;

crypto/bn/bn_gf2m.c:966:5: Call
964.   
965.    err:
966.       BN_CTX_end(ctx);
           ^
967.       return ret;
968.   }

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

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

crypto/bn/bn_ctx.c:435:1: <LHS trace>
433.   }
434.   
435. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
436.   {
437.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:435:1: Parameter `p->used`
    433.   }
    434.   
    435. > static void BN_POOL_release(BN_POOL *p, unsigned int num)
    436.   {
    437.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;

crypto/bn/bn_ctx.c:437:5: Binary operation: ([0, +oo] - 1):unsigned32 by call to `BN_CTX_end` 
    435.   static void BN_POOL_release(BN_POOL *p, unsigned int num)
    436.   {
    437.       unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
               ^
    438.       p->used -= num;
    439.       while (num--) {

static void BN_POOL_release(BN_POOL *p, unsigned int num)
{
    unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;
    p->used -= num;
    while (num--) {
        bn_check_top(p->current->vals + offset);
        if (!offset) {
            offset = BN_CTX_POOL_SIZE - 1;
            p->current = p->current->prev;
        } else
            offset--;
    }
}
['int BN_GF2m_mod_div_arr(BIGNUM *r, const BIGNUM *yy, const BIGNUM *xx,\n                        const int p[], BN_CTX *ctx)\n{\n    BIGNUM *field;\n    int ret = 0;\n    bn_check_top(yy);\n    bn_check_top(xx);\n    BN_CTX_start(ctx);\n    if ((field = BN_CTX_get(ctx)) == NULL)\n        goto err;\n    if (!BN_GF2m_arr2poly(p, field))\n        goto err;\n    ret = BN_GF2m_mod_div(r, yy, xx, field, ctx);\n    bn_check_top(r);\n err:\n    BN_CTX_end(ctx);\n    return ret;\n}', 'BIGNUM *BN_CTX_get(BN_CTX *ctx)\n{\n    BIGNUM *ret;\n    CTXDBG_ENTRY("BN_CTX_get", ctx);\n    if (ctx->err_stack || ctx->too_many)\n        return NULL;\n    if ((ret = BN_POOL_get(&ctx->pool)) == NULL) {\n        ctx->too_many = 1;\n        BNerr(BN_F_BN_CTX_GET, BN_R_TOO_MANY_TEMPORARY_VARIABLES);\n        return NULL;\n    }\n    BN_zero(ret);\n    ctx->used++;\n    CTXDBG_RET(ctx, ret);\n    return ret;\n}', 'void BN_CTX_end(BN_CTX *ctx)\n{\n    CTXDBG_ENTRY("BN_CTX_end", ctx);\n    if (ctx->err_stack)\n        ctx->err_stack--;\n    else {\n        unsigned int fp = BN_STACK_pop(&ctx->stack);\n        if (fp < ctx->used)\n            BN_POOL_release(&ctx->pool, ctx->used - fp);\n        ctx->used = fp;\n        ctx->too_many = 0;\n    }\n    CTXDBG_EXIT(ctx);\n}', 'static void BN_POOL_release(BN_POOL *p, unsigned int num)\n{\n    unsigned int offset = (p->used - 1) % BN_CTX_POOL_SIZE;\n    p->used -= num;\n    while (num--) {\n        bn_check_top(p->current->vals + offset);\n        if (!offset) {\n            offset = BN_CTX_POOL_SIZE - 1;\n            p->current = p->current->prev;\n        } else\n            offset--;\n    }\n}']