Lazy Satisfiability Modulo Theories

Abstract

Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a first-order formula with respect to some decidable first-order theory T (SMT (T)). These problems are typically not handled adequately by standard automated theorem provers. SMT is being recognized as increasingly important due to its applications in many domains in different communities, in particular in formal verification. An amount of papers with novel and very efficient techniques for SMT has been published in the last years, and some very efficient SMT tools are now available. Typical SMT (T) problems require testing the satisfiability of formulas which are Boolean combinations of atomic propositions and atomic expressions in T , so that heavy Boolean reasoning must be efficiently combined with expressive theory-specific reasoning. The dominating approach to SMT (T), called lazy approach, is based on the integration of a SAT solver and of a decision procedure able to handle sets of atomic constraints in T (T-solver), handling respectively the Boolean and the theory-specific components of reasoning. Unfortunately, neither the problem of building an efficient SMT solver, nor even that of acquiring a comprehensive background knowledge in lazy SMT, is of simple solution. In this paper we present an extensive survey of SMT, with particular focus on the lazy approach. We survey, classify and analyze from a theory-independent perspective the most effective techniques and optimizations which are of interest for lazy SMT and which have been proposed in various communities; we discuss their relative benefits and drawbacks; we provide some guidelines about their choice and usage; we also analyze the features for SAT solvers and T-solvers which make them more suitable for an integration. The ultimate goals of this paper are to become a source of a common background knowledge and terminology for students and researchers in different areas, to provide a reference guide for developers of SMT tools, and to stimulate the cross-fertilization of techniques and ideas among different communities.

Z3str3: A String Solver with Theory-aware Heuristics

“…We implement theory-aware branching as a modification of the branching heuristic in Z3. This idea of creating a theory-aware DPLL branching heuristic is mentioned in [13]. The default branching heuristic in Z3 is activity-based, similar to VSIDS [9].…”

Multi-objective reasoning with constrained goal models

“…Satisfiability Modulo Theories (SMT) is the problem of deciding the satisfiability of a quantifier-free first-order formula Φ with respect to some decidable theory T (see [35,5]). In this paper, we focus on the theory of linear arithmetic over the rationals, LRA: SMT(LRA) is the problem of checking the satisfiability of a formula Φ consisting in atomic propositions A 1 , A 2 , ... and linear-arithmetic constraints over rational variables like "(2.1x 1 −3.4x 2 +3.2x 3 ≤ 4.2)", combined by means of Boolean operators ¬, ∧, ∨, →, ↔.…”

“…Very efficient SMT(LRA) and OMT(LRA) solvers are available, which combine the power of modern SAT solvers with dedicated linear-programming decision and minimization procedures (see [35,5,8,31,37,38,40,39]). For instance, in the empirical evaluation reported in [38] the OMT(LRA) solver OptiMathSAT [38,39] was able to handle optimization problems with up to thousands Boolean/rational variables in less than 10 minutes each.…”

Computing Small Unsatisfiable Cores in Satisfiability Modulo Theories

“…The on-line lazy SMT (T ) schema is a coarse description of the procedures underlying all the state-of-the-art lazy SMT (T ) tools like, e.g., BarceLogic, CVC3, MathSAT, Yices, Z3. The interested reader is pointed to, e.g., the work of Nieuwenhuis et al (2006), Barrett and Tinelli (2007), Bruttomesso et al (2008), Dutertre and de Moura (2006), and de Moura and Bjørner (2008), for details and further references, or to the work of Sebastiani (2007) and Barrett, Sebastiani, Seshia, and Tinelli (2009) for a survey.…”