SAT based counterexample-guided abstraction-refinement

Abstract. We describe new techniques for model checking in the counterexample guided abstraction-refinement framework. The abstraction phase ‘hides ’ the logic of various variables, hence considering them as inputs. This type of abstraction may lead to ‘spurious ’ counterexamples, i.e. traces that cannot be simulated on the original (concrete) machine. We check whether a counterexample is real or spurious with a SAT checker. We then use a combination of 0-1 Integer Linear Programming (ILP) and machine learning techniques for refining the abstraction based on the counterexample. The process is repeated until either a real counterexample is found or the property is verified. We have implemented these techniques on top of the model checker NuSMV and the SAT solver Chaff. Experimental results prove the viability of these new techniques.