RaSAT: SMT solver for nonlinear constraints Vu Xuan Tung – Mizuhito Ogawa (JAIST) To Van Khanh (UET) 44 th TRS Meeting – 22-23 Feb 2016 - Kanazawa 1.

Slides:



Advertisements
Similar presentations
SMELS: Sat Modulo Equality with Lazy Superposition Christopher Lynch – Clarkson Duc-Khanh Tran - MPI.
Advertisements

50.530: Software Engineering
Linear Programming, 1 Max c 1 *X 1 +…+ c n *X n = z s.t. a 11 *X 1 +…+ a 1n *X n  b 1 … a m1 *X 1 +…+ a mn *X n  b m X 1, X n  0 Standard form.
On Solving Presburger and Linear Arithmetic with SAT Ofer Strichman Carnegie Mellon University.
Reachability Analysis for AMS Verification using Hybrid Support Function and SMT- based Method Honghuang Lin, Peng Li Dept. of ECE, Texas A&M University.
Leonardo de Moura and Nikolaj Bjørner Microsoft Research.
Program Analysis as Constraint Solving Sumit Gulwani (MSR Redmond) Ramarathnam Venkatesan (MSR Redmond) Saurabh Srivastava (Univ. of Maryland) TexPoint.
SAT and Model Checking. Bounded Model Checking (BMC) A.I. Planning problems: can we reach a desired state in k steps? Verification of safety properties:
Discovering Affine Equalities Using Random Interpretation Sumit Gulwani George Necula EECS Department University of California, Berkeley.
Nikolaj Bjørner Microsoft Research Lecture 3. DayTopicsLab 1Overview of SMT and applications. SAT solving, Z3 Encoding combinatorial problems with Z3.
Interpolants [Craig 1957] G(y,z) F(x,y)
1 Satisfiability Modulo Theories Sinan Hanay. 2 Boolean Satisfiability (SAT) Is there an assignment to the p 1, p 2, …, p n variables such that  evaluates.
1 Deciding separation formulas with SAT Ofer Strichman Sanjit A. Seshia Randal E. Bryant School of Computer Science, Carnegie Mellon University.
Revision.
1 A propositional world Ofer Strichman School of Computer Science, Carnegie Mellon University.
Using Decision Procedures for Program Verification Christopher Lynch Clarkson University.
26 April 2013Lecture 6: Problem Solving1 Problem Solving Jorge Cruz DI/FCT/UNL April 2013.
On Solving Presburger and Linear Arithmetic with SAT Ofer Strichman Carnegie Mellon University.
Linear Simultaneous Equations
Solving Systems of three equations with three variables Using substitution or elimination.
9.4 – Solving Absolute Value Equations and Inequalities 1.
Leonardo de Moura Microsoft Research. Many approaches Graph-based for difference logic: a – b  3 Fourier-Motzkin elimination: Standard Simplex General.
Center for Machine Perception Department of Cybernetics, Faculty of Electrical Engineering Czech Technical University in Prague Methods for Solving Systems.
5.3 Systems of Linear Equations in Three Variables
Math Dept, Faculty of Applied Science, HCM University of Technology
Deciding a Combination of Theories - Decision Procedure - Changki pswlab Combination of Theories Daniel Kroening, Ofer Strichman Presented by Changki.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities Algebra 2 Chapter 3 Notes Systems of Linear Equalities and Inequalities.
Table of Contents Topic Page # A Absolute Value Less ThAND B Absolute Value GreatOR Than Two Variable Inequalities Solve Systems.
Floating-point arithmetic FPA semantics FPA representation sign.
Constraint-based Invariant Inference. Invariants Dictionary Meaning: A function, quantity, or property which remains unchanged Property (in our context):
1 Decision Procedures for Linear Arithmetic Presented By Omer Katz 01/04/14 Based on slides by Ofer Strichman.
SAT and SMT solvers Ayrat Khalimov (based on Georg Hofferek‘s slides) AKDV 2014.
Copyright © 2013, 2009, 2005 Pearson Education, Inc. 1 5 Systems and Matrices Copyright © 2013, 2009, 2005 Pearson Education, Inc.
Solvers for the Problem of Boolean Satisfiability (SAT) Will Klieber Aug 31, 2011 TexPoint fonts used in EMF. Read the TexPoint manual before you.
Solving Non-linear Arithmetic Dejan Jovanovic and Leonadro de Moura Presented by Boris Trayvas.
Symbolic and Concolic Execution of Programs Information Security, CS 526 Omar Chowdhury 10/7/2015Information Security, CS 5261.
9.3 – Linear Equation and Inequalities 1. Linear Equations 2.
Midterm Notes ABI101. Simultaneous Equations Simultaneous Equations are a set of equations containing multiple variables.equations This set is often referred.
CS357 Lecture 13: Symbolic model checking without BDDs Alex Aiken David Dill 1.
Logic Engines as a Service Leonardo de Moura and Nikolaj Bjørner Microsoft Research.
Selected Decision Procedures and Techniques for SMT More on combination – theories sharing sets – convex theory Un-interpreted function symbols (quantifier-free.
SOLVING SYSTEMS OF EQUATIONS BY SUBSTITUTION. #1. SOLVE one equation for the easiest variable a. Isolated variable b. Leading Coefficient of One #2. SUBSTITUTE.
Algebra Review. Systems of Equations Review: Substitution Linear Combination 2 Methods to Solve:
Satisfiability Modulo Theories and DPLL(T) Andrew Reynolds March 18, 2015.
Copyright © Cengage Learning. All rights reserved.
Satisfiability Modulo Theories
Solving Systems of Linear Equations by Addition
Solving Linear Equations and Inequalities
Solver & Optimization Problems
Gauss-Siedel Method.
SMT-Based Verification of Parameterized Systems
Solving Linear Arithmetic with SAT-based MC
Simplify 2 7 +√5 Simplify 4 2−√ √5 Solve 1+
Mining backbone literals in incremental SAT
Canonical Computation without Canonical Data Structure
Canonical Computation Without Canonical Data Structure
Simultaneous Equations
Graphical Solution Procedure
A Progressive Approach for Satisfiability Modulo Theories
Linear Algebra Lecture 3.
Solving Percent Problem with Equations
Math I Quarter I Standards
Discrete Least Squares Approximation
Canonical Computation without Canonical Data Structure
Solving Linear Equations and Inequalities
Chapter 7: Systems of Equations and Inequalities; Matrices
Canonical Computation without Canonical Data Structure
Solving Two-Step Equations
Multivariable Linear Systems
Presentation transcript:

raSAT: SMT solver for nonlinear constraints Vu Xuan Tung – Mizuhito Ogawa (JAIST) To Van Khanh (UET) 44 th TRS Meeting – Feb Kanazawa 1

(Existential) Non-linear Constraints.  Satisfiability of : where  Example:  Notions: UNSAT for Unsatisfiability, SAT for Satisfiability 2

Applications 3 Many applications in Software Verification Invariants Generation Analysis of Round-off and Over-flow Errors Termination Proof of Term Rewriting Systems

Related methods 4  CAD: complete DEXP for general quantified formulas. EXP for Quantifier-free formulas with optimizations.  Virtual substitution: degree < 5. EXP.  Grobner basis: Equalities. EXP  Interval Constraint Propagation (ICP): Inequalities. EXP on solvable constraints.  Bit-blasting: Bounded variables and precision.  Linearization: Bounded variables and precision.

raSAT – an SMT Solver for Polynomial Constraints  Proposed and developed by Dr. To Van Khanh who received his Ph.D. from JAIST in  raSAT: ICP + Testing + IVT. ICP = Interval Arithmetic + Constraint Propagation + Box Decomposition Testing: boost SAT detection. IVT: The Intermediate Value Theorem for Equations 5

Interval Arithmetic (IA) 6 Interval Arithmetic Intervals of Variables Intervals of Polynomials

Constraint Propagation (CP)  E.g., x 2 + xy < 4 x ∈ [-3,1], y ∈ [-4,-2] 7 + ** x xxy [-3,1] [-4,-2] [0,9][-4,12] [-4,21] [-4,4] – [-4,12] = [-16,8][-4,4] – [0,9] = [-13,4] [0,8] = [-16,8] ∩ ∩ [-13,4] = [-4,4] ∩ (-∞,∞) = [-4, 2] [-2.8..,1] = [-2.8.., 2.8..]∩ [-4,4] <4 [-4,4) / [-3,1] = (-∞,∞) sqrt([0, 8]) = [-2.8.., 2.8..] [-2,1] Result: x ∈ [-2, 1], y ∈ [-4, 2]

ICP vs raSAT loop 8

Testing 9 Test-SAT with values for x, y Generate values for each variable based on heuristics from IA find values for variables that satisfy the constraint Test-UNSAT Test-SAT implies SAT while Test-UNSAT implies UNKNOWN

Completeness Failure of ICP and raSAT loop 10 SAT DetectionUNSAT Detection Kissing case Convergence

Non-constructive Handling of Equations  The Intermediate Value Theorem (IVT) 11

Non-constructive Handling of Equations  The Generalized IVT Multiple equations |Variables| ≧ |Equations|  Example: 12 Neumaier, A.: Interval Methods for Systems of Equations. Cambridge Middle East Library, Cambridge University Press (1990)

raSAT loop + IVT 13

Results  SMT-COMP 2015 QF_NRA: problems Recently revision on CP + IVT: 8517 QF_NIA: 8475 problems 14 Solver[Z3]Yices2-NLSMT-RATraSATCVC3CVC4 (exp)CVC4 Solved No Solver[Z3]AProVEraSAT SMT-RAT (parallel) SMT-RATCVC3CVC4 (exp) Solved No (1 wrong)

Conclusion  ICP is practically efficient though not complete raSAT shows ability to solve large SAT/UNSAT constraints e.g. matrix-2-3, 2-8,3-5, 4-3 and 4-9 in Zankl which have 57, 17, 81, 139 and 193 variables resp. hong family with UNSAT problems of 1, 2, …, 20 variables where problems with10-20 variables are challenging with CAD-based solvers.  Completeness might be achieved by combining with CAD and Gröbner basis  under investigation. 15

16