SMT-COMP 2026

The International Satisfiability Modulo Theories (SMT) Competition.

GitHub

SMT-COMP 2026

QF_UFBVLIA (Incremental Track)

Competition results for the QF_UFBVLIA logic in the Incremental Track. Chart

Results were generated on 2026-07-25

Benchmarks: 179
Time Limit: 1200 seconds
Memory Limit: 30720 GB

Winners

Parallel PerformanceSAT Performance (parallel)UNSAT Performance (parallel)24 seconds Performance (parallel)
Yices2--Yices2

Parallel Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Yices2020711.1111.110179000
cvc5020730.8230.820179000
SMTInterpol0207196.13196.130179000
z3-BooledASS ne00
(base +0)		1.111.410179000
z3-BooledASS-base n000.000.000179000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver

24 seconds Performance Performance

SolverError ScoreCorrect ScoreCPU Time ScoreWall Time ScoreSolvedUnsolvedAbstainedTimeoutMemout
Yices2020711.1111.110179000
cvc5020730.8230.820179000
SMTInterpol0206171.12171.120178100
z3-BooledASS ne00
(base +0)		1.111.410179000
z3-BooledASS-base n000.000.000179000
(base +/- n): for derived solvers: increment over base solver
ne: not eligible for winning as it does not substantially improve over the base solver (at least 10 % improvement in PAR2 score) n: non-competing solver