v4.2.2

This release adds "no refinement progress detection" to the XSTS cli.
(Turning it off is possible with the --no-stuck-check flag)

v4.2.1

This release fixes a bug related to local variables in the XSTS formalism.

v4.2.0

This release adds basic function support to Theta, meaning it can now verify recursive programs. The previously used function inlining can be turned back on with the --inline ON flag.

v4.1.0

The new release contains a partial order reduction algorithm for multi-threaded programs. The algorithm has a formalism-independent core (PorLts), and an implementation for the XCFA interleavings algorithm (XcfaPorLts). POR can be enabled with the --algorithm INTERLEAVINGS_POR flag.

v4.0.0

This release adds many important changes to Theta. The most important ones:

1. frontends subproject-family adds a place for non-dsl parsers for the formalisms in Theta
2. c-frontend subproject adds support for C programs
3. xcfa subproject-family adds a new formalism, the eXtended Control Flow Automaton to Theta
4. An experimental portfolio and algorithm selection engine for the XCFA formalism
5. An experimental BMC implementation

v3.0.2

This release fixes a bug of ArrayInit expressions.

v3.0.1

This fixes a problem with parsing bitvector extract expressions due to FpType declaration syntax (See issue #148)

SV-COMP'22 v1

This release contains the binaries and the source tree of the version which is submitted to the qualification run of the SV-COMP 2022 competition.

Minimal necessary packages for Ubuntu 20.04 LTS:

• openjdk-11-jre-headless
• libgomp1
• libmpfr-dev

Note: this release might contain unstable features and is NOT built from master.

SV-COMP 22 Qualification Run Submission

This release contains the binaries and the source tree of the version which is submitted to the qualification run of the SV-COMP 2022 competition.

Minimal necessary packages for Ubuntu 20.04 LTS:

• openjdk-11-jre-headless
• libgomp1
• libmpfr-dev

Note: this release might contain unstable features and is NOT built from master.

v3.0.0

This release introduces alpha support for generic SMT-LIB compatible SMT solvers. Currently supported solvers are: Z3, MathSAT, CVC4, Yices2, Princess, SMTInterpol and Boolector. The support also includes interpolation support. For more information see the project page.

The release introduces theta-solver-smtlib-cli.jar that is a CLI to manage the different versions of solvers installed (see). The new solvers are only available on Linux and for the CFA frontend right now. The new solvers can be used by configuring the --solver, --abstraction-solver or --refinement-solver option of the theta-cfa-cli.jar tool (see).