java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerBplInline.xml -i ../../../trunk/examples/programs/scalable/CTR_CounterExp-8bit_incorrect.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:54:05,645 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:54:05,647 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:54:05,661 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:54:05,661 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:54:05,662 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:54:05,665 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:54:05,668 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:54:05,670 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:54:05,673 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:54:05,674 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:54:05,674 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:54:05,675 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:54:05,676 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:54:05,679 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:54:05,680 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:54:05,681 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:54:05,690 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:54:05,692 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:54:05,698 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:54:05,701 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:54:05,702 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:54:05,704 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:54:05,705 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:54:05,709 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:54:05,709 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:54:05,709 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:54:05,711 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:54:05,711 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:54:05,712 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:54:05,712 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:54:05,716 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:54:05,717 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:54:05,718 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:54:05,719 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:54:05,719 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:54:05,720 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:54:05,722 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:54:05,722 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:54:05,723 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:54:05,724 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:54:05,762 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:54:05,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:54:05,784 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:54:05,785 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:54:05,786 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:54:05,787 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-8bit_incorrect.bpl [2019-08-05 10:54:05,787 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-8bit_incorrect.bpl' [2019-08-05 10:54:05,825 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:54:05,827 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:54:05,827 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:05,827 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:54:05,828 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:54:05,845 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,855 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,860 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:54:05,861 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:54:05,861 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:54:05,863 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:54:05,864 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:54:05,864 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:54:05,864 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:54:05,875 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,875 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,876 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,876 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,880 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,886 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,887 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... [2019-08-05 10:54:05,889 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:54:05,890 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:54:05,890 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:54:05,890 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:54:05,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-08-05 10:54:05,964 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:54:05,965 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:54:05,965 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:54:06,855 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:54:06,855 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:54:06,857 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:06 BoogieIcfgContainer [2019-08-05 10:54:06,857 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:54:06,858 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:54:06,858 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:54:06,861 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:54:06,862 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:54:05" (1/2) ... [2019-08-05 10:54:06,863 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@51596fe9 and model type CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:54:06, skipping insertion in model container [2019-08-05 10:54:06,863 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:54:06" (2/2) ... [2019-08-05 10:54:06,865 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-8bit_incorrect.bpl [2019-08-05 10:54:06,875 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:54:06,884 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:54:06,897 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:54:06,921 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:54:06,922 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:54:06,922 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:54:06,923 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:54:06,923 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:54:06,923 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:54:06,923 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:54:06,923 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:54:06,924 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:54:06,938 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:54:06,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:54:06,949 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:06,950 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:54:06,954 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:06,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:06,960 INFO L82 PathProgramCache]: Analyzing trace with hash 32864, now seen corresponding path program 1 times [2019-08-05 10:54:07,006 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:07,025 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:54:07,029 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:07,071 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:07,073 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:54:07,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:54:07,077 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:54:07,089 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:54:07,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:54:07,093 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:54:07,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:07,144 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:54:07,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:54:07,145 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:54:07,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:07,154 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:54:07,154 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:54:07,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:54:07,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:54:07,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:54:07,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:54:07,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:54:07,184 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:54:07,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:07,184 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:54:07,185 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:54:07,185 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:54:07,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:54:07,185 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:07,185 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:54:07,186 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:07,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:07,186 INFO L82 PathProgramCache]: Analyzing trace with hash 1051524, now seen corresponding path program 1 times [2019-08-05 10:54:07,187 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:07,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:07,202 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:54:07,203 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:07,331 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:07,331 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:07,331 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:54:07,333 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:54:07,333 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:54:07,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:54:07,334 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:54:07,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:07,431 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:54:07,432 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:54:07,432 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:54:07,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:07,432 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:54:07,433 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:54:07,433 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:54:07,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:54:07,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:54:07,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:54:07,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:54:07,436 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:54:07,436 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:07,436 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:54:07,437 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:54:07,437 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:54:07,437 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:54:07,437 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:07,437 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:54:07,437 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:07,438 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:07,438 INFO L82 PathProgramCache]: Analyzing trace with hash 32629984, now seen corresponding path program 2 times [2019-08-05 10:54:07,439 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:07,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:07,461 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:54:07,462 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:07,586 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:07,587 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:07,587 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:54:07,587 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:54:07,588 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:54:07,588 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:54:07,588 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:54:07,665 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:07,666 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:54:07,666 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:54:07,666 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:54:07,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:07,667 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:54:07,667 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:54:07,668 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:07,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:54:07,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:54:07,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:54:07,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:54:07,670 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:54:07,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:07,670 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:54:07,670 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:54:07,670 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:54:07,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:54:07,671 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:07,671 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:54:07,671 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:07,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:07,672 INFO L82 PathProgramCache]: Analyzing trace with hash 1011562244, now seen corresponding path program 3 times [2019-08-05 10:54:07,673 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:07,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:07,700 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:54:07,703 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:07,873 WARN L188 SmtUtils]: Spent 123.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:54:08,056 WARN L188 SmtUtils]: Spent 122.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:54:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:08,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:08,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:54:08,149 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:54:08,149 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:54:08,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:08,149 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:54:08,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:08,225 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:54:08,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:54:08,225 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:54:08,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:08,226 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:54:08,227 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:54:08,227 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:54:08,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:54:08,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:54:08,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:54:08,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:54:08,230 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:54:08,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:08,230 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:54:08,230 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:54:08,231 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:54:08,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:54:08,231 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:08,231 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:54:08,231 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:08,232 INFO L82 PathProgramCache]: Analyzing trace with hash 1293691232, now seen corresponding path program 4 times [2019-08-05 10:54:08,233 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:08,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:08,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 18 conjunts are in the unsatisfiable core [2019-08-05 10:54:08,268 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:08,490 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:54:08,490 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:08,490 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:54:08,491 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:54:08,491 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:54:08,492 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:54:08,492 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 6 states. [2019-08-05 10:54:08,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:08,657 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:54:08,658 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:54:08,658 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 7 [2019-08-05 10:54:08,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:08,659 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:54:08,659 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:54:08,659 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:08,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:54:08,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:54:08,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:54:08,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:54:08,661 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:54:08,661 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:08,662 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:54:08,662 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:54:08,662 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:54:08,662 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:54:08,662 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:08,662 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:54:08,663 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:08,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:08,663 INFO L82 PathProgramCache]: Analyzing trace with hash 1449755268, now seen corresponding path program 5 times [2019-08-05 10:54:08,664 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:08,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:08,686 WARN L254 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 47 conjunts are in the unsatisfiable core [2019-08-05 10:54:08,706 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:08,901 WARN L188 SmtUtils]: Spent 168.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:54:09,247 WARN L188 SmtUtils]: Spent 156.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:54:09,378 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:09,379 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:09,379 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:54:09,379 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:54:09,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:54:09,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:09,380 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 8 states. [2019-08-05 10:54:09,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:09,446 INFO L93 Difference]: Finished difference Result 11 states and 11 transitions. [2019-08-05 10:54:09,446 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:54:09,446 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 8 [2019-08-05 10:54:09,447 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:09,447 INFO L225 Difference]: With dead ends: 11 [2019-08-05 10:54:09,448 INFO L226 Difference]: Without dead ends: 11 [2019-08-05 10:54:09,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:09,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states. [2019-08-05 10:54:09,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2019-08-05 10:54:09,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-08-05 10:54:09,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 11 transitions. [2019-08-05 10:54:09,451 INFO L78 Accepts]: Start accepts. Automaton has 11 states and 11 transitions. Word has length 8 [2019-08-05 10:54:09,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:09,452 INFO L475 AbstractCegarLoop]: Abstraction has 11 states and 11 transitions. [2019-08-05 10:54:09,452 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:54:09,452 INFO L276 IsEmpty]: Start isEmpty. Operand 11 states and 11 transitions. [2019-08-05 10:54:09,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2019-08-05 10:54:09,452 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:09,453 INFO L399 BasicCegarLoop]: trace histogram [7, 1, 1, 1] [2019-08-05 10:54:09,453 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:09,453 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:09,453 INFO L82 PathProgramCache]: Analyzing trace with hash 1646456324, now seen corresponding path program 6 times [2019-08-05 10:54:09,454 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:09,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:09,488 WARN L254 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 56 conjunts are in the unsatisfiable core [2019-08-05 10:54:09,497 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:09,903 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:09,903 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:09,904 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 10:54:09,904 INFO L454 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-08-05 10:54:09,904 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-08-05 10:54:09,905 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:54:09,905 INFO L87 Difference]: Start difference. First operand 11 states and 11 transitions. Second operand 10 states. [2019-08-05 10:54:09,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:09,981 INFO L93 Difference]: Finished difference Result 13 states and 13 transitions. [2019-08-05 10:54:09,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 10:54:09,982 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 10 [2019-08-05 10:54:09,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:09,983 INFO L225 Difference]: With dead ends: 13 [2019-08-05 10:54:09,983 INFO L226 Difference]: Without dead ends: 13 [2019-08-05 10:54:09,984 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:54:09,984 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13 states. [2019-08-05 10:54:09,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13 to 13. [2019-08-05 10:54:09,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2019-08-05 10:54:09,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 13 transitions. [2019-08-05 10:54:09,986 INFO L78 Accepts]: Start accepts. Automaton has 13 states and 13 transitions. Word has length 10 [2019-08-05 10:54:09,986 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:09,987 INFO L475 AbstractCegarLoop]: Abstraction has 13 states and 13 transitions. [2019-08-05 10:54:09,987 INFO L476 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-08-05 10:54:09,987 INFO L276 IsEmpty]: Start isEmpty. Operand 13 states and 13 transitions. [2019-08-05 10:54:09,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 10:54:09,987 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:09,988 INFO L399 BasicCegarLoop]: trace histogram [9, 1, 1, 1] [2019-08-05 10:54:09,988 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:09,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:09,988 INFO L82 PathProgramCache]: Analyzing trace with hash 1697610116, now seen corresponding path program 7 times [2019-08-05 10:54:09,989 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:10,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:10,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 80 conjunts are in the unsatisfiable core [2019-08-05 10:54:10,044 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:10,424 INFO L134 CoverageAnalysis]: Checked inductivity of 45 backedges. 0 proven. 45 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:10,424 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:10,425 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:54:10,425 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:54:10,426 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:54:10,426 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:10,426 INFO L87 Difference]: Start difference. First operand 13 states and 13 transitions. Second operand 12 states. [2019-08-05 10:54:10,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:10,532 INFO L93 Difference]: Finished difference Result 15 states and 15 transitions. [2019-08-05 10:54:10,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:54:10,532 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 12 [2019-08-05 10:54:10,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:10,533 INFO L225 Difference]: With dead ends: 15 [2019-08-05 10:54:10,534 INFO L226 Difference]: Without dead ends: 15 [2019-08-05 10:54:10,534 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:10,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2019-08-05 10:54:10,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2019-08-05 10:54:10,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2019-08-05 10:54:10,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2019-08-05 10:54:10,537 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2019-08-05 10:54:10,538 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:10,538 INFO L475 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2019-08-05 10:54:10,538 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:54:10,538 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2019-08-05 10:54:10,538 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-08-05 10:54:10,538 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:10,539 INFO L399 BasicCegarLoop]: trace histogram [11, 1, 1, 1] [2019-08-05 10:54:10,539 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:10,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:10,539 INFO L82 PathProgramCache]: Analyzing trace with hash -683203324, now seen corresponding path program 8 times [2019-08-05 10:54:10,540 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:10,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:10,565 INFO L256 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 43 conjunts are in the unsatisfiable core [2019-08-05 10:54:10,581 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:10,762 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 58 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-08-05 10:54:10,763 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:10,763 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:54:10,763 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:54:10,764 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:54:10,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:54:10,764 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 8 states. [2019-08-05 10:54:10,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:10,899 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2019-08-05 10:54:10,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-08-05 10:54:10,900 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 14 [2019-08-05 10:54:10,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:10,901 INFO L225 Difference]: With dead ends: 17 [2019-08-05 10:54:10,901 INFO L226 Difference]: Without dead ends: 17 [2019-08-05 10:54:10,902 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:10,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-08-05 10:54:10,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-08-05 10:54:10,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-08-05 10:54:10,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2019-08-05 10:54:10,906 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 14 [2019-08-05 10:54:10,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:10,906 INFO L475 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2019-08-05 10:54:10,906 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:54:10,906 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2019-08-05 10:54:10,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 10:54:10,907 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:10,907 INFO L399 BasicCegarLoop]: trace histogram [13, 1, 1, 1] [2019-08-05 10:54:10,908 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:10,908 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:10,908 INFO L82 PathProgramCache]: Analyzing trace with hash 572649604, now seen corresponding path program 9 times [2019-08-05 10:54:10,909 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:10,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:10,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 62 conjunts are in the unsatisfiable core [2019-08-05 10:54:10,961 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:11,458 INFO L134 CoverageAnalysis]: Checked inductivity of 91 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:54:11,458 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:11,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:54:11,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:54:11,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:54:11,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=110, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:54:11,460 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 12 states. [2019-08-05 10:54:11,965 WARN L188 SmtUtils]: Spent 144.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:54:12,333 WARN L188 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:54:12,705 WARN L188 SmtUtils]: Spent 140.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:54:12,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:12,866 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2019-08-05 10:54:12,867 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-08-05 10:54:12,867 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 16 [2019-08-05 10:54:12,867 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:12,868 INFO L225 Difference]: With dead ends: 21 [2019-08-05 10:54:12,868 INFO L226 Difference]: Without dead ends: 21 [2019-08-05 10:54:12,869 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:54:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2019-08-05 10:54:12,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-08-05 10:54:12,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-08-05 10:54:12,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2019-08-05 10:54:12,872 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 16 [2019-08-05 10:54:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:12,872 INFO L475 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2019-08-05 10:54:12,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:54:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2019-08-05 10:54:12,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 10:54:12,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:12,873 INFO L399 BasicCegarLoop]: trace histogram [17, 1, 1, 1] [2019-08-05 10:54:12,873 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:12,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:12,873 INFO L82 PathProgramCache]: Analyzing trace with hash -1560221820, now seen corresponding path program 10 times [2019-08-05 10:54:12,874 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:12,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:12,904 WARN L254 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 145 conjunts are in the unsatisfiable core [2019-08-05 10:54:12,916 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 153 backedges. 0 proven. 153 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:13,637 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:13,637 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:54:13,638 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:54:13,638 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:54:13,638 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:54:13,639 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 20 states. [2019-08-05 10:54:13,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:13,911 INFO L93 Difference]: Finished difference Result 29 states and 29 transitions. [2019-08-05 10:54:13,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:54:13,911 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 20 [2019-08-05 10:54:13,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:13,912 INFO L225 Difference]: With dead ends: 29 [2019-08-05 10:54:13,912 INFO L226 Difference]: Without dead ends: 29 [2019-08-05 10:54:13,913 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=54, Invalid=326, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:54:13,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2019-08-05 10:54:13,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2019-08-05 10:54:13,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2019-08-05 10:54:13,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2019-08-05 10:54:13,918 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 20 [2019-08-05 10:54:13,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:13,918 INFO L475 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2019-08-05 10:54:13,919 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:54:13,919 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2019-08-05 10:54:13,919 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 10:54:13,919 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:13,920 INFO L399 BasicCegarLoop]: trace histogram [25, 1, 1, 1] [2019-08-05 10:54:13,920 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:13,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:13,920 INFO L82 PathProgramCache]: Analyzing trace with hash -410757756, now seen corresponding path program 11 times [2019-08-05 10:54:13,921 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:13,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:13,965 WARN L254 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 209 conjunts are in the unsatisfiable core [2019-08-05 10:54:13,986 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:14,223 WARN L188 SmtUtils]: Spent 211.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:54:15,494 INFO L134 CoverageAnalysis]: Checked inductivity of 325 backedges. 0 proven. 325 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:15,495 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:15,495 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [27] total 27 [2019-08-05 10:54:15,495 INFO L454 AbstractCegarLoop]: Interpolant automaton has 28 states [2019-08-05 10:54:15,496 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2019-08-05 10:54:15,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:54:15,496 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 28 states. [2019-08-05 10:54:16,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:16,316 INFO L93 Difference]: Finished difference Result 37 states and 37 transitions. [2019-08-05 10:54:16,317 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-08-05 10:54:16,317 INFO L78 Accepts]: Start accepts. Automaton has 28 states. Word has length 28 [2019-08-05 10:54:16,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:16,318 INFO L225 Difference]: With dead ends: 37 [2019-08-05 10:54:16,318 INFO L226 Difference]: Without dead ends: 37 [2019-08-05 10:54:16,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=78, Invalid=678, Unknown=0, NotChecked=0, Total=756 [2019-08-05 10:54:16,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2019-08-05 10:54:16,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 37. [2019-08-05 10:54:16,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2019-08-05 10:54:16,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 37 transitions. [2019-08-05 10:54:16,324 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 37 transitions. Word has length 28 [2019-08-05 10:54:16,324 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:16,324 INFO L475 AbstractCegarLoop]: Abstraction has 37 states and 37 transitions. [2019-08-05 10:54:16,324 INFO L476 AbstractCegarLoop]: Interpolant automaton has 28 states. [2019-08-05 10:54:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 37 transitions. [2019-08-05 10:54:16,325 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 10:54:16,325 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:16,326 INFO L399 BasicCegarLoop]: trace histogram [33, 1, 1, 1] [2019-08-05 10:54:16,326 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:16,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:16,326 INFO L82 PathProgramCache]: Analyzing trace with hash 1622786948, now seen corresponding path program 12 times [2019-08-05 10:54:16,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:16,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:16,381 WARN L254 TraceCheckSpWp]: Trace formula consists of 310 conjuncts, 266 conjunts are in the unsatisfiable core [2019-08-05 10:54:16,408 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:17,506 INFO L134 CoverageAnalysis]: Checked inductivity of 561 backedges. 0 proven. 561 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:17,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:17,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:54:17,506 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:54:17,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:54:17,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=1127, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:54:17,508 INFO L87 Difference]: Start difference. First operand 37 states and 37 transitions. Second operand 36 states. [2019-08-05 10:54:18,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:18,573 INFO L93 Difference]: Finished difference Result 45 states and 45 transitions. [2019-08-05 10:54:18,573 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:54:18,573 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 36 [2019-08-05 10:54:18,574 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:18,574 INFO L225 Difference]: With dead ends: 45 [2019-08-05 10:54:18,575 INFO L226 Difference]: Without dead ends: 45 [2019-08-05 10:54:18,576 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=169, Invalid=1163, Unknown=0, NotChecked=0, Total=1332 [2019-08-05 10:54:18,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2019-08-05 10:54:18,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2019-08-05 10:54:18,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45 states. [2019-08-05 10:54:18,581 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 45 transitions. [2019-08-05 10:54:18,581 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 45 transitions. Word has length 36 [2019-08-05 10:54:18,582 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:18,582 INFO L475 AbstractCegarLoop]: Abstraction has 45 states and 45 transitions. [2019-08-05 10:54:18,582 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:54:18,582 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 45 transitions. [2019-08-05 10:54:18,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2019-08-05 10:54:18,583 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:18,583 INFO L399 BasicCegarLoop]: trace histogram [41, 1, 1, 1] [2019-08-05 10:54:18,584 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:18,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:18,584 INFO L82 PathProgramCache]: Analyzing trace with hash 1017196932, now seen corresponding path program 13 times [2019-08-05 10:54:18,585 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:18,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:18,649 WARN L254 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 338 conjunts are in the unsatisfiable core [2019-08-05 10:54:18,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:20,356 INFO L134 CoverageAnalysis]: Checked inductivity of 861 backedges. 0 proven. 861 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:20,357 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:20,357 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [43] total 43 [2019-08-05 10:54:20,357 INFO L454 AbstractCegarLoop]: Interpolant automaton has 44 states [2019-08-05 10:54:20,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2019-08-05 10:54:20,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:54:20,358 INFO L87 Difference]: Start difference. First operand 45 states and 45 transitions. Second operand 44 states. [2019-08-05 10:54:21,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:21,596 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2019-08-05 10:54:21,597 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-08-05 10:54:21,597 INFO L78 Accepts]: Start accepts. Automaton has 44 states. Word has length 44 [2019-08-05 10:54:21,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:21,599 INFO L225 Difference]: With dead ends: 53 [2019-08-05 10:54:21,599 INFO L226 Difference]: Without dead ends: 53 [2019-08-05 10:54:21,600 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=126, Invalid=1766, Unknown=0, NotChecked=0, Total=1892 [2019-08-05 10:54:21,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-08-05 10:54:21,604 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-08-05 10:54:21,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-08-05 10:54:21,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 53 transitions. [2019-08-05 10:54:21,605 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 53 transitions. Word has length 44 [2019-08-05 10:54:21,605 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:21,605 INFO L475 AbstractCegarLoop]: Abstraction has 53 states and 53 transitions. [2019-08-05 10:54:21,606 INFO L476 AbstractCegarLoop]: Interpolant automaton has 44 states. [2019-08-05 10:54:21,606 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 53 transitions. [2019-08-05 10:54:21,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2019-08-05 10:54:21,607 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:21,607 INFO L399 BasicCegarLoop]: trace histogram [49, 1, 1, 1] [2019-08-05 10:54:21,608 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:21,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:21,608 INFO L82 PathProgramCache]: Analyzing trace with hash -1455775868, now seen corresponding path program 14 times [2019-08-05 10:54:21,609 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:21,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:21,671 WARN L254 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 402 conjunts are in the unsatisfiable core [2019-08-05 10:54:21,732 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:24,182 INFO L134 CoverageAnalysis]: Checked inductivity of 1225 backedges. 0 proven. 1225 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:24,183 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:24,183 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [51] total 51 [2019-08-05 10:54:24,183 INFO L454 AbstractCegarLoop]: Interpolant automaton has 52 states [2019-08-05 10:54:24,183 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2019-08-05 10:54:24,184 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:54:24,185 INFO L87 Difference]: Start difference. First operand 53 states and 53 transitions. Second operand 52 states. [2019-08-05 10:54:26,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:26,406 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2019-08-05 10:54:26,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 52 states. [2019-08-05 10:54:26,407 INFO L78 Accepts]: Start accepts. Automaton has 52 states. Word has length 52 [2019-08-05 10:54:26,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:26,408 INFO L225 Difference]: With dead ends: 61 [2019-08-05 10:54:26,408 INFO L226 Difference]: Without dead ends: 61 [2019-08-05 10:54:26,410 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=150, Invalid=2502, Unknown=0, NotChecked=0, Total=2652 [2019-08-05 10:54:26,411 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2019-08-05 10:54:26,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2019-08-05 10:54:26,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2019-08-05 10:54:26,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2019-08-05 10:54:26,415 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 52 [2019-08-05 10:54:26,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:26,416 INFO L475 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2019-08-05 10:54:26,416 INFO L476 AbstractCegarLoop]: Interpolant automaton has 52 states. [2019-08-05 10:54:26,416 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2019-08-05 10:54:26,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-08-05 10:54:26,417 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:26,417 INFO L399 BasicCegarLoop]: trace histogram [57, 1, 1, 1] [2019-08-05 10:54:26,417 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:26,417 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:26,418 INFO L82 PathProgramCache]: Analyzing trace with hash -729412220, now seen corresponding path program 15 times [2019-08-05 10:54:26,418 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:26,467 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:26,481 WARN L254 TraceCheckSpWp]: Trace formula consists of 526 conjuncts, 466 conjunts are in the unsatisfiable core [2019-08-05 10:54:26,512 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:29,473 INFO L134 CoverageAnalysis]: Checked inductivity of 1653 backedges. 0 proven. 1653 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:29,474 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:29,474 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [59] total 59 [2019-08-05 10:54:29,474 INFO L454 AbstractCegarLoop]: Interpolant automaton has 60 states [2019-08-05 10:54:29,474 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2019-08-05 10:54:29,476 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:54:29,476 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 60 states. [2019-08-05 10:54:31,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:31,782 INFO L93 Difference]: Finished difference Result 69 states and 69 transitions. [2019-08-05 10:54:31,783 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 60 states. [2019-08-05 10:54:31,783 INFO L78 Accepts]: Start accepts. Automaton has 60 states. Word has length 60 [2019-08-05 10:54:31,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:31,784 INFO L225 Difference]: With dead ends: 69 [2019-08-05 10:54:31,784 INFO L226 Difference]: Without dead ends: 69 [2019-08-05 10:54:31,786 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=174, Invalid=3366, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:54:31,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2019-08-05 10:54:31,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 69. [2019-08-05 10:54:31,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2019-08-05 10:54:31,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2019-08-05 10:54:31,791 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 60 [2019-08-05 10:54:31,791 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:31,791 INFO L475 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2019-08-05 10:54:31,791 INFO L476 AbstractCegarLoop]: Interpolant automaton has 60 states. [2019-08-05 10:54:31,791 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2019-08-05 10:54:31,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-08-05 10:54:31,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:31,792 INFO L399 BasicCegarLoop]: trace histogram [65, 1, 1, 1] [2019-08-05 10:54:31,793 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:31,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:31,793 INFO L82 PathProgramCache]: Analyzing trace with hash -326927484, now seen corresponding path program 16 times [2019-08-05 10:54:31,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:31,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:31,869 WARN L254 TraceCheckSpWp]: Trace formula consists of 598 conjuncts, 523 conjunts are in the unsatisfiable core [2019-08-05 10:54:31,914 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:35,912 INFO L134 CoverageAnalysis]: Checked inductivity of 2145 backedges. 0 proven. 2145 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:35,912 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:35,912 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:54:35,913 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:54:35,913 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:54:35,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=261, Invalid=4295, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:54:35,914 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 68 states. [2019-08-05 10:54:39,019 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:39,020 INFO L93 Difference]: Finished difference Result 77 states and 77 transitions. [2019-08-05 10:54:39,020 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:54:39,020 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 68 [2019-08-05 10:54:39,020 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:39,021 INFO L225 Difference]: With dead ends: 77 [2019-08-05 10:54:39,021 INFO L226 Difference]: Without dead ends: 77 [2019-08-05 10:54:39,022 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=329, Invalid=4363, Unknown=0, NotChecked=0, Total=4692 [2019-08-05 10:54:39,023 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2019-08-05 10:54:39,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2019-08-05 10:54:39,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77 states. [2019-08-05 10:54:39,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 77 transitions. [2019-08-05 10:54:39,027 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 77 transitions. Word has length 68 [2019-08-05 10:54:39,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:39,027 INFO L475 AbstractCegarLoop]: Abstraction has 77 states and 77 transitions. [2019-08-05 10:54:39,027 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:54:39,028 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 77 transitions. [2019-08-05 10:54:39,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2019-08-05 10:54:39,029 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:39,029 INFO L399 BasicCegarLoop]: trace histogram [73, 1, 1, 1] [2019-08-05 10:54:39,029 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:39,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:39,030 INFO L82 PathProgramCache]: Analyzing trace with hash 523430276, now seen corresponding path program 17 times [2019-08-05 10:54:39,030 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:39,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:39,096 WARN L254 TraceCheckSpWp]: Trace formula consists of 670 conjuncts, 375 conjunts are in the unsatisfiable core [2019-08-05 10:54:39,130 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:39,550 INFO L134 CoverageAnalysis]: Checked inductivity of 2701 backedges. 0 proven. 2573 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2019-08-05 10:54:39,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:39,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:54:39,551 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:54:39,552 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:54:39,552 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=342, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:54:39,552 INFO L87 Difference]: Start difference. First operand 77 states and 77 transitions. Second operand 20 states. [2019-08-05 10:54:40,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:40,150 INFO L93 Difference]: Finished difference Result 85 states and 85 transitions. [2019-08-05 10:54:40,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 10:54:40,150 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 76 [2019-08-05 10:54:40,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:40,151 INFO L225 Difference]: With dead ends: 85 [2019-08-05 10:54:40,151 INFO L226 Difference]: Without dead ends: 85 [2019-08-05 10:54:40,152 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 120 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=102, Invalid=1158, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:54:40,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2019-08-05 10:54:40,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2019-08-05 10:54:40,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 85 states. [2019-08-05 10:54:40,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 85 transitions. [2019-08-05 10:54:40,158 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 85 transitions. Word has length 76 [2019-08-05 10:54:40,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:40,158 INFO L475 AbstractCegarLoop]: Abstraction has 85 states and 85 transitions. [2019-08-05 10:54:40,158 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:54:40,158 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 85 transitions. [2019-08-05 10:54:40,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2019-08-05 10:54:40,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:40,160 INFO L399 BasicCegarLoop]: trace histogram [81, 1, 1, 1] [2019-08-05 10:54:40,160 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:40,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1701554300, now seen corresponding path program 18 times [2019-08-05 10:54:40,161 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:40,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:40,229 WARN L254 TraceCheckSpWp]: Trace formula consists of 742 conjuncts, 496 conjunts are in the unsatisfiable core [2019-08-05 10:54:40,275 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:41,271 INFO L134 CoverageAnalysis]: Checked inductivity of 3321 backedges. 0 proven. 3257 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2019-08-05 10:54:41,271 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:41,272 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:54:41,272 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:54:41,272 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:54:41,273 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=1190, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:54:41,273 INFO L87 Difference]: Start difference. First operand 85 states and 85 transitions. Second operand 36 states. [2019-08-05 10:54:42,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:42,915 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2019-08-05 10:54:42,916 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2019-08-05 10:54:42,916 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 84 [2019-08-05 10:54:42,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:42,917 INFO L225 Difference]: With dead ends: 101 [2019-08-05 10:54:42,918 INFO L226 Difference]: Without dead ends: 101 [2019-08-05 10:54:42,919 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 496 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=198, Invalid=4358, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:54:42,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2019-08-05 10:54:42,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2019-08-05 10:54:42,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2019-08-05 10:54:42,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2019-08-05 10:54:42,924 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 84 [2019-08-05 10:54:42,924 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:42,924 INFO L475 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2019-08-05 10:54:42,925 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:54:42,925 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2019-08-05 10:54:42,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 101 [2019-08-05 10:54:42,926 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:42,926 INFO L399 BasicCegarLoop]: trace histogram [97, 1, 1, 1] [2019-08-05 10:54:42,927 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:42,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:42,927 INFO L82 PathProgramCache]: Analyzing trace with hash 594359172, now seen corresponding path program 19 times [2019-08-05 10:54:42,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:42,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:43,011 WARN L254 TraceCheckSpWp]: Trace formula consists of 886 conjuncts, 689 conjunts are in the unsatisfiable core [2019-08-05 10:54:43,059 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:46,341 INFO L134 CoverageAnalysis]: Checked inductivity of 4753 backedges. 0 proven. 4721 refuted. 0 times theorem prover too weak. 32 trivial. 0 not checked. [2019-08-05 10:54:46,342 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:46,342 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:54:46,342 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:54:46,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:54:46,343 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=4422, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:54:46,344 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 68 states. [2019-08-05 10:54:51,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:51,774 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2019-08-05 10:54:51,775 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 68 states. [2019-08-05 10:54:51,775 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 100 [2019-08-05 10:54:51,775 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:51,776 INFO L225 Difference]: With dead ends: 133 [2019-08-05 10:54:51,776 INFO L226 Difference]: Without dead ends: 133 [2019-08-05 10:54:51,782 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 5.5s TimeCoverageRelationStatistics Valid=390, Invalid=16902, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:54:51,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2019-08-05 10:54:51,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2019-08-05 10:54:51,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2019-08-05 10:54:51,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 133 transitions. [2019-08-05 10:54:51,787 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 133 transitions. Word has length 100 [2019-08-05 10:54:51,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:51,787 INFO L475 AbstractCegarLoop]: Abstraction has 133 states and 133 transitions. [2019-08-05 10:54:51,787 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:54:51,787 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 133 transitions. [2019-08-05 10:54:51,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 133 [2019-08-05 10:54:51,789 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:51,789 INFO L399 BasicCegarLoop]: trace histogram [129, 1, 1, 1] [2019-08-05 10:54:51,789 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:51,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:51,790 INFO L82 PathProgramCache]: Analyzing trace with hash -2055804028, now seen corresponding path program 20 times [2019-08-05 10:54:51,791 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:51,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:54:52,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-08-05 10:54:52,246 INFO L466 BasicCegarLoop]: Counterexample might be feasible [2019-08-05 10:54:52,366 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-8bit_incorrect.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:54:52 BoogieIcfgContainer [2019-08-05 10:54:52,366 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:54:52,368 INFO L168 Benchmark]: Toolchain (without parser) took 46541.50 ms. Allocated memory was 141.6 MB in the beginning and 720.9 MB in the end (delta: 579.3 MB). Free memory was 111.1 MB in the beginning and 107.8 MB in the end (delta: 3.3 MB). Peak memory consumption was 582.6 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,369 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,370 INFO L168 Benchmark]: Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,371 INFO L168 Benchmark]: Boogie Preprocessor took 25.89 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,371 INFO L168 Benchmark]: RCFGBuilder took 966.91 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 75.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,372 INFO L168 Benchmark]: TraceAbstraction took 45507.97 ms. Allocated memory was 141.6 MB in the beginning and 720.9 MB in the end (delta: 579.3 MB). Free memory was 75.3 MB in the beginning and 107.8 MB in the end (delta: -32.5 MB). Peak memory consumption was 546.8 MB. Max. memory is 7.1 GB. [2019-08-05 10:54:52,376 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 141.6 MB. Free memory was 112.3 MB in the beginning and 112.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 36.06 ms. Allocated memory is still 141.6 MB. Free memory was 110.9 MB in the beginning and 109.0 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 25.89 ms. Allocated memory is still 141.6 MB. Free memory was 109.0 MB in the beginning and 107.9 MB in the end (delta: 1.1 MB). Peak memory consumption was 1.1 MB. Max. memory is 7.1 GB. * RCFGBuilder took 966.91 ms. Allocated memory is still 141.6 MB. Free memory was 107.7 MB in the beginning and 75.5 MB in the end (delta: 32.2 MB). Peak memory consumption was 32.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 45507.97 ms. Allocated memory was 141.6 MB in the beginning and 720.9 MB in the end (delta: 579.3 MB). Free memory was 75.3 MB in the beginning and 107.8 MB in the end (delta: -32.5 MB). Peak memory consumption was 546.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 86]: assertion can be violated assertion can be violated We found a FailurePath: [L5] of := false; [L6] x0 := false; [L7] x1 := false; [L8] x2 := false; [L9] x3 := false; [L10] x4 := false; [L11] x5 := false; [L12] x6 := false; [L13] x7 := false; VAL [of=false, x0=false, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND FALSE !(x0 == true) [L20] x0 := true; [L22] COND FALSE !(of == true) [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=false, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND FALSE !(x5 == true) [L63] x5 := true; [L64] of := false; [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=true, x6=false, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND TRUE x5 == true [L60] x5 := false; [L67] COND TRUE of == true [L68] COND FALSE !(x6 == true) [L72] x6 := true; [L73] of := false; [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=false, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND FALSE !(x5 == true) [L63] x5 := true; [L64] of := false; [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=true, x6=true, x7=false] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND TRUE x5 == true [L60] x5 := false; [L67] COND TRUE of == true [L68] COND TRUE x6 == true [L69] x6 := false; [L76] COND TRUE of == true [L77] COND FALSE !(x7 == true) [L81] x7 := true; [L82] of := false; VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=false, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND FALSE !(x5 == true) [L63] x5 := true; [L64] of := false; [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=true, x6=false, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND TRUE x5 == true [L60] x5 := false; [L67] COND TRUE of == true [L68] COND FALSE !(x6 == true) [L72] x6 := true; [L73] of := false; [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=false, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND FALSE !(x5 == true) [L63] x5 := true; [L64] of := false; [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=false, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND FALSE !(x4 == true) [L54] x4 := true; [L55] of := false; [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=false, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=false, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=false, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=false, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND FALSE !(x3 == true) [L45] x3 := true; [L46] of := false; [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=false, x3=true, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=false, x3=true, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND FALSE !(x2 == true) [L36] x2 := true; [L37] of := false; [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=false, x2=true, x3=true, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND FALSE !(x1 == true) [L27] x1 := true; [L28] of := false; [L31] COND FALSE !(of == true) [L40] COND FALSE !(of == true) [L49] COND FALSE !(of == true) [L58] COND FALSE !(of == true) [L67] COND FALSE !(of == true) [L76] COND FALSE !(of == true) VAL [of=false, x0=true, x1=true, x2=true, x3=true, x4=true, x5=true, x6=true, x7=true] [L15] COND TRUE of == false [L16] COND TRUE x0 == true [L17] x0 := true; [L18] of := true; [L22] COND TRUE of == true [L23] COND TRUE x1 == true [L24] x1 := false; [L31] COND TRUE of == true [L32] COND TRUE x2 == true [L33] x2 := false; [L40] COND TRUE of == true [L41] COND TRUE x3 == true [L42] x3 := false; [L49] COND TRUE of == true [L50] COND TRUE x4 == true [L51] x4 := false; [L58] COND TRUE of == true [L59] COND TRUE x5 == true [L60] x5 := false; [L67] COND TRUE of == true [L68] COND TRUE x6 == true [L69] x6 := false; [L76] COND TRUE of == true [L77] COND TRUE x7 == true [L78] x7 := false; VAL [of=true, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] [L15] COND FALSE !(of == false) VAL [of=true, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] [L86] assert !x0 && !x1 && !x2 && !x3 && !x4 && !x5 && !x6 && !x7; VAL [of=true, x0=true, x1=false, x2=false, x3=false, x4=false, x5=false, x6=false, x7=false] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. UNSAFE Result, 45.4s OverallTime, 21 OverallIterations, 129 TraceHistogramMax, 21.0s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 55 SDtfs, 12 SDslu, 141 SDs, 0 SdLazy, 20163 SolverSat, 445 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 13.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 765 GetRequests, 167 SyntacticMatches, 0 SemanticMatches, 598 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2667 ImplicationChecksByTransitivity, 25.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133occurred in iteration=20, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 20 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 22.8s InterpolantComputationTime, 785 NumberOfCodeBlocks, 785 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 633 ConstructedInterpolants, 0 QuantifiedInterpolants, 435562 SizeOfPredicates, 149 NumberOfNonLiveVariables, 5597 ConjunctsInSsa, 4256 ConjunctsInUnsatCore, 20 InterpolantComputations, 1 PerfectInterpolantSequences, 237/17963 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...