Any formal method or tool is almost certainly more often applied in situationswhere the outcome is failure (a counterexample) rather than success (a correctness proof). We present a method for symbolic model checking that can lead to signi cant time and memory savings for model-checking runs that fail, while occurring only a small overhead for model-checking runs that succeed. Our method discov...