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-32bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:52:06,422 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:52:06,424 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:52:06,437 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:52:06,438 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:52:06,439 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:52:06,441 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:52:06,444 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:52:06,446 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:52:06,448 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:52:06,449 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:52:06,450 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:52:06,450 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:52:06,451 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:52:06,454 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:52:06,455 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:52:06,456 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:52:06,465 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:52:06,467 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:52:06,472 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:52:06,476 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:52:06,477 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:52:06,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:52:06,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:52:06,487 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:52:06,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:52:06,487 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:52:06,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:52:06,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:52:06,491 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:52:06,491 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:52:06,494 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:52:06,495 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:52:06,497 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:52:06,499 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:52:06,499 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:52:06,499 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:52:06,500 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:52:06,500 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:52:06,502 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:52:06,503 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:52:06,534 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:52:06,549 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:52:06,554 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:52:06,555 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:52:06,556 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:52:06,557 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-32bit.bpl [2019-08-05 10:52:06,557 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CTR_CounterExp-32bit.bpl' [2019-08-05 10:52:06,620 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:52:06,622 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:52:06,623 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:06,623 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:52:06,623 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:52:06,641 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,654 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,662 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:52:06,662 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:52:06,662 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:52:06,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:52:06,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:52:06,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:52:06,666 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:52:06,678 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,679 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,689 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,702 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,724 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,726 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/1) ... [2019-08-05 10:52:06,731 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:52:06,734 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:52:06,734 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:52:06,735 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:52:06,739 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (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:52:06,807 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:52:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:52:06,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:52:09,610 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:52:09,610 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:52:09,612 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:09 BoogieIcfgContainer [2019-08-05 10:52:09,612 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:52:09,614 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:52:09,614 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:52:09,637 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:52:09,637 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:52:06" (1/2) ... [2019-08-05 10:52:09,638 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31a585d4 and model type CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:52:09, skipping insertion in model container [2019-08-05 10:52:09,639 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:52:09" (2/2) ... [2019-08-05 10:52:09,640 INFO L109 eAbstractionObserver]: Analyzing ICFG CTR_CounterExp-32bit.bpl [2019-08-05 10:52:09,650 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:52:09,663 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:52:09,681 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:52:09,713 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:52:09,714 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:52:09,714 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:52:09,715 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:52:09,715 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:52:09,715 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:52:09,716 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:52:09,716 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:52:09,717 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:52:09,736 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:52:09,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:52:09,754 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:09,755 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:52:09,758 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:09,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:09,768 INFO L82 PathProgramCache]: Analyzing trace with hash 42080, now seen corresponding path program 1 times [2019-08-05 10:52:09,826 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:09,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:09,863 INFO L256 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:52:09,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:09,948 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:52:09,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:52:09,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:52:09,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:52:09,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:52:09,971 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:52:09,974 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:52:10,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:10,040 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:10,041 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:52:10,042 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:52:10,043 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:10,053 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:10,053 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:52:10,055 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:52:10,074 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:52:10,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:52:10,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:52:10,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:52:10,089 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:52:10,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:10,089 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:52:10,090 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:52:10,090 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:52:10,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:52:10,090 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:10,090 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:52:10,091 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:10,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:10,091 INFO L82 PathProgramCache]: Analyzing trace with hash 1429764, now seen corresponding path program 1 times [2019-08-05 10:52:10,092 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:10,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:10,133 INFO L256 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:52:10,134 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:10,257 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:52:10,258 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:10,258 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:52:10,259 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:52:10,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:52:10,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:52:10,260 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:52:10,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:10,353 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:52:10,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:52:10,355 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:52:10,355 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:10,355 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:52:10,355 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:52:10,357 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:52:10,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:52:10,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:52:10,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:52:10,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:52:10,359 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:52:10,360 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:10,360 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:52:10,360 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:52:10,360 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:52:10,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:52:10,361 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:10,361 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:52:10,361 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:10,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:10,362 INFO L82 PathProgramCache]: Analyzing trace with hash 44447968, now seen corresponding path program 2 times [2019-08-05 10:52:10,363 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:10,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:10,484 WARN L254 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 69 conjunts are in the unsatisfiable core [2019-08-05 10:52:10,504 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:10,642 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:10,880 WARN L188 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:11,045 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:52:11,046 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:11,047 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:11,047 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:11,047 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:11,048 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:11,049 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:52:11,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,204 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:52:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:11,204 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:52:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,205 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:52:11,205 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:52:11,206 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:52:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:52:11,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:52:11,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:52:11,208 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:52:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,208 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:52:11,208 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:11,208 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:52:11,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:52:11,209 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,209 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:52:11,209 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash 1378012292, now seen corresponding path program 3 times [2019-08-05 10:52:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:11,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:11,281 WARN L254 TraceCheckSpWp]: Trace formula consists of 136 conjuncts, 70 conjunts are in the unsatisfiable core [2019-08-05 10:52:11,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:11,572 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:11,811 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:52:11,811 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:11,811 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:52:11,812 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:52:11,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:52:11,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:52:11,813 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:52:11,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:11,908 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:52:11,908 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:52:11,909 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:52:11,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:11,909 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:52:11,910 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:52:11,910 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:52:11,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:52:11,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:52:11,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:52:11,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:52:11,913 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:52:11,913 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:11,913 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:52:11,913 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:52:11,913 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:52:11,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:52:11,914 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:11,914 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:52:11,915 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:11,915 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:11,915 INFO L82 PathProgramCache]: Analyzing trace with hash -231166624, now seen corresponding path program 4 times [2019-08-05 10:52:11,916 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,021 WARN L254 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 102 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,036 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:12,171 WARN L188 SmtUtils]: Spent 111.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:12,537 WARN L188 SmtUtils]: Spent 118.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:52:12,804 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:12,804 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:12,805 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:52:12,805 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:52:12,805 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:52:12,806 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:12,806 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:52:12,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:12,926 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:52:12,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:12,932 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:52:12,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:12,933 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:52:12,933 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:52:12,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:12,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:52:12,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:52:12,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:52:12,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:52:12,936 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:52:12,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:12,936 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:52:12,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:52:12,937 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:52:12,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:52:12,937 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:12,937 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:52:12,938 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:12,938 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:12,938 INFO L82 PathProgramCache]: Analyzing trace with hash 1423894532, now seen corresponding path program 5 times [2019-08-05 10:52:12,939 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:12,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:12,976 INFO L256 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 39 conjunts are in the unsatisfiable core [2019-08-05 10:52:12,988 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,089 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 10:52:13,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:13,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:52:13,090 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:52:13,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:52:13,091 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:52:13,091 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:52:13,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,155 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:52:13,155 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:52:13,155 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:52:13,155 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,156 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:52:13,156 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:52:13,156 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:52:13,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:52:13,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:52:13,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:52:13,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:52:13,159 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:52:13,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,159 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:52:13,160 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:52:13,160 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:52:13,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:52:13,160 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,160 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:52:13,161 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,161 INFO L82 PathProgramCache]: Analyzing trace with hash 1191182816, now seen corresponding path program 6 times [2019-08-05 10:52:13,162 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,209 INFO L256 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 77 conjunts are in the unsatisfiable core [2019-08-05 10:52:13,220 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:13,347 WARN L188 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:52:13,816 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:52:13,817 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:13,817 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:52:13,817 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:52:13,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:52:13,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:52:13,818 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 10:52:13,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:13,908 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:52:13,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:52:13,909 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 10:52:13,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:13,909 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:52:13,909 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:52:13,910 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:52:13,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:52:13,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:52:13,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:52:13,913 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:52:13,913 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:52:13,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:13,914 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:52:13,914 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:52:13,914 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:52:13,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:52:13,915 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:13,915 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:52:13,915 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:13,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:13,916 INFO L82 PathProgramCache]: Analyzing trace with hash -2025572768, now seen corresponding path program 7 times [2019-08-05 10:52:13,917 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:13,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:13,995 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 232 conjunts are in the unsatisfiable core [2019-08-05 10:52:14,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:14,408 WARN L188 SmtUtils]: Spent 114.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:14,790 WARN L188 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:52:15,093 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:52:15,857 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:15,858 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:15,858 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:52:15,859 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:52:15,859 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:52:15,859 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:52:15,859 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:52:16,704 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:16,705 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:52:16,705 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:16,706 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:52:16,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:16,707 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:52:16,707 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:52:16,708 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=44, Invalid=88, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:52:16,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:52:16,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:52:16,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:52:16,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:52:16,712 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-08-05 10:52:16,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:16,712 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:52:16,712 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:52:16,713 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:52:16,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:52:16,713 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:16,713 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:52:16,714 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:16,714 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:16,714 INFO L82 PathProgramCache]: Analyzing trace with hash 694370144, now seen corresponding path program 8 times [2019-08-05 10:52:16,715 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:16,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:16,823 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 131 conjunts are in the unsatisfiable core [2019-08-05 10:52:16,835 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:17,131 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 76 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-08-05 10:52:17,131 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:17,132 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2019-08-05 10:52:17,132 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 10:52:17,132 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 10:52:17,134 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2019-08-05 10:52:17,135 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 13 states. [2019-08-05 10:52:17,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:17,360 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:52:17,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:52:17,360 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 15 [2019-08-05 10:52:17,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:17,361 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:52:17,362 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:52:17,362 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=258, Unknown=0, NotChecked=0, Total=306 [2019-08-05 10:52:17,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:52:17,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:52:17,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:52:17,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:52:17,365 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:52:17,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:17,366 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:52:17,366 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 10:52:17,366 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:52:17,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:52:17,367 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:17,367 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:52:17,367 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:17,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:17,367 INFO L82 PathProgramCache]: Analyzing trace with hash 584435808, now seen corresponding path program 9 times [2019-08-05 10:52:17,368 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:17,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:17,466 WARN L254 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 524 conjunts are in the unsatisfiable core [2019-08-05 10:52:17,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:17,672 WARN L188 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:52:18,512 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 0 proven. 136 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:18,512 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:18,512 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:52:18,513 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:52:18,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:52:18,514 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:18,514 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:52:18,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:18,880 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:52:18,881 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:52:18,881 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:52:18,881 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:18,882 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:52:18,882 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:52:18,883 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:52:18,884 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:52:18,886 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:52:18,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:52:18,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:52:18,887 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:52:18,887 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:18,888 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:52:18,888 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:52:18,888 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:52:18,888 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:52:18,888 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:18,889 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:52:18,889 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:18,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:18,889 INFO L82 PathProgramCache]: Analyzing trace with hash -1531618720, now seen corresponding path program 10 times [2019-08-05 10:52:18,890 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:19,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:19,042 WARN L254 TraceCheckSpWp]: Trace formula consists of 829 conjuncts, 784 conjunts are in the unsatisfiable core [2019-08-05 10:52:19,106 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:20,514 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 300 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:20,514 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:20,514 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:52:20,515 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:52:20,515 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:52:20,516 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:20,516 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:52:21,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:21,487 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:52:21,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:52:21,488 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:52:21,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:21,489 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:52:21,489 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:52:21,490 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:52:21,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:52:21,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:52:21,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:52:21,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:52:21,494 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:52:21,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:21,495 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:52:21,495 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:52:21,495 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:52:21,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:52:21,496 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:21,496 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:52:21,496 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:21,496 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:21,496 INFO L82 PathProgramCache]: Analyzing trace with hash -555553696, now seen corresponding path program 11 times [2019-08-05 10:52:21,497 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:21,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:21,670 WARN L254 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1044 conjunts are in the unsatisfiable core [2019-08-05 10:52:21,754 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:22,943 WARN L188 SmtUtils]: Spent 215.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:24,022 WARN L188 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:52:24,248 INFO L134 CoverageAnalysis]: Checked inductivity of 528 backedges. 0 proven. 528 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:24,249 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:24,249 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:52:24,249 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:52:24,250 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:52:24,250 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:24,250 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:52:25,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:25,313 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:52:25,313 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:52:25,314 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:52:25,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:25,315 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:52:25,316 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:52:25,317 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:52:25,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:52:25,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:52:25,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:52:25,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:52:25,321 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-08-05 10:52:25,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:25,321 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:52:25,322 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:52:25,322 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:52:25,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:52:25,323 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:25,323 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:52:25,323 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:25,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:25,324 INFO L82 PathProgramCache]: Analyzing trace with hash -1554088352, now seen corresponding path program 12 times [2019-08-05 10:52:25,324 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:25,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:25,523 WARN L254 TraceCheckSpWp]: Trace formula consists of 1357 conjuncts, 1304 conjunts are in the unsatisfiable core [2019-08-05 10:52:25,613 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:28,199 INFO L134 CoverageAnalysis]: Checked inductivity of 820 backedges. 0 proven. 820 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:28,200 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:28,200 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:52:28,200 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:52:28,200 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:52:28,201 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:28,202 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:52:29,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:29,680 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:52:29,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:52:29,681 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:52:29,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:29,682 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:52:29,683 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:52:29,684 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:52:29,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:52:29,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:52:29,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:52:29,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:52:29,689 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-08-05 10:52:29,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:29,690 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:52:29,690 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:52:29,690 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:52:29,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:52:29,691 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:29,691 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:52:29,692 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:29,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:29,692 INFO L82 PathProgramCache]: Analyzing trace with hash -1004007328, now seen corresponding path program 13 times [2019-08-05 10:52:29,693 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:29,903 WARN L254 TraceCheckSpWp]: Trace formula consists of 1621 conjuncts, 1564 conjunts are in the unsatisfiable core [2019-08-05 10:52:30,000 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:33,180 INFO L134 CoverageAnalysis]: Checked inductivity of 1176 backedges. 0 proven. 1176 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:33,180 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:33,180 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:52:33,181 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:52:33,181 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:52:33,182 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:33,182 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:52:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:35,604 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:52:35,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:52:35,605 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:52:35,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:35,606 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:52:35,607 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:52:35,608 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:52:35,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:52:35,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:52:35,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:52:35,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:52:35,614 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 51 [2019-08-05 10:52:35,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:35,614 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:52:35,614 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:52:35,615 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:52:35,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:52:35,616 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:35,616 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:52:35,616 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:35,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:35,616 INFO L82 PathProgramCache]: Analyzing trace with hash 322937440, now seen corresponding path program 14 times [2019-08-05 10:52:35,617 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:35,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:35,820 WARN L254 TraceCheckSpWp]: Trace formula consists of 1885 conjuncts, 1824 conjunts are in the unsatisfiable core [2019-08-05 10:52:35,932 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:39,745 INFO L134 CoverageAnalysis]: Checked inductivity of 1596 backedges. 0 proven. 1596 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:39,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:39,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:52:39,746 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:52:39,746 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:52:39,747 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:39,747 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:52:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:42,537 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:52:42,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:52:42,537 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:52:42,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:42,539 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:52:42,539 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:52:42,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=171, Invalid=3251, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:52:42,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:52:42,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:52:42,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:52:42,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:52:42,546 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 59 [2019-08-05 10:52:42,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:42,546 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:52:42,546 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:52:42,546 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:52:42,547 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:52:42,547 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:42,548 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:52:42,548 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:42,548 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:42,548 INFO L82 PathProgramCache]: Analyzing trace with hash 1654994016, now seen corresponding path program 15 times [2019-08-05 10:52:42,549 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:42,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:42,799 WARN L254 TraceCheckSpWp]: Trace formula consists of 2149 conjuncts, 2053 conjunts are in the unsatisfiable core [2019-08-05 10:52:42,957 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:47,889 INFO L134 CoverageAnalysis]: Checked inductivity of 2080 backedges. 0 proven. 2080 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:47,890 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:47,890 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:52:47,890 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:52:47,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:52:47,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:52:47,892 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:52:51,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:52:51,462 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:52:51,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:52:51,468 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:52:51,468 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:52:51,469 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:52:51,469 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:52:51,471 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.5s TimeCoverageRelationStatistics Valid=324, Invalid=4232, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:52:51,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:52:51,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:52:51,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:52:51,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:52:51,478 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 67 [2019-08-05 10:52:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:52:51,478 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:52:51,478 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:52:51,479 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:52:51,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:52:51,480 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:52:51,480 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:52:51,480 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:52:51,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:52:51,481 INFO L82 PathProgramCache]: Analyzing trace with hash -2074556832, now seen corresponding path program 16 times [2019-08-05 10:52:51,481 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:52:51,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:52:51,793 WARN L254 TraceCheckSpWp]: Trace formula consists of 2413 conjuncts, 2345 conjunts are in the unsatisfiable core [2019-08-05 10:52:51,943 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:52:54,721 WARN L188 SmtUtils]: Spent 119.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:52:57,525 INFO L134 CoverageAnalysis]: Checked inductivity of 2628 backedges. 0 proven. 2628 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:52:57,525 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:52:57,526 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:52:57,526 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:52:57,526 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:52:57,528 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:52:57,528 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:53:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:02,339 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:53:02,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:53:02,340 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:53:02,340 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:02,341 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:53:02,341 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:53:02,344 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:02,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:53:02,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:53:02,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:53:02,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:53:02,349 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 75 [2019-08-05 10:53:02,349 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:02,350 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:53:02,350 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:53:02,350 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:53:02,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:53:02,353 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:02,353 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:53:02,353 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:02,353 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:02,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1247434848, now seen corresponding path program 17 times [2019-08-05 10:53:02,354 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:02,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:02,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 2677 conjuncts, 2605 conjunts are in the unsatisfiable core [2019-08-05 10:53:02,759 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:09,085 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:09,085 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:09,086 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:53:09,086 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:53:09,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:53:09,089 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:09,089 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:53:14,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:14,862 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:53:14,863 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:53:14,863 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:53:14,864 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:14,864 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:53:14,865 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:53:14,867 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:14,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:53:14,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:53:14,871 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:53:14,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:53:14,872 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 83 [2019-08-05 10:53:14,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:14,872 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:53:14,872 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:53:14,872 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:53:14,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:53:14,873 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:14,873 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:53:14,874 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:14,874 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:14,874 INFO L82 PathProgramCache]: Analyzing trace with hash -2035684768, now seen corresponding path program 18 times [2019-08-05 10:53:14,875 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:15,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:15,132 WARN L254 TraceCheckSpWp]: Trace formula consists of 2941 conjuncts, 2865 conjunts are in the unsatisfiable core [2019-08-05 10:53:15,373 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:23,458 INFO L134 CoverageAnalysis]: Checked inductivity of 3916 backedges. 0 proven. 3916 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:23,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:23,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:53:23,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:53:23,460 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:53:23,462 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:53:23,462 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:53:30,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:30,316 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:53:30,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:53:30,316 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:53:30,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:30,317 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:53:30,317 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:53:30,319 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:53:30,320 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:53:30,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:53:30,324 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:53:30,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:53:30,324 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 91 [2019-08-05 10:53:30,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:30,325 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:53:30,325 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:53:30,325 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:53:30,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:53:30,326 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:30,326 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:53:30,326 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:30,326 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:30,327 INFO L82 PathProgramCache]: Analyzing trace with hash 189234272, now seen corresponding path program 19 times [2019-08-05 10:53:30,327 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:30,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:30,601 WARN L254 TraceCheckSpWp]: Trace formula consists of 3205 conjuncts, 3125 conjunts are in the unsatisfiable core [2019-08-05 10:53:30,793 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:39,077 INFO L134 CoverageAnalysis]: Checked inductivity of 4656 backedges. 0 proven. 4656 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:39,077 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:39,077 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:53:39,078 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:53:39,078 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:53:39,079 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:53:39,079 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:53:47,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:47,090 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:53:47,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:53:47,091 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:53:47,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:47,092 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:53:47,092 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:53:47,093 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.6s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:53:47,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:53:47,097 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:53:47,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:53:47,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:53:47,098 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 99 [2019-08-05 10:53:47,099 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:47,099 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:53:47,099 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:53:47,099 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:53:47,100 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:53:47,100 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:47,100 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:53:47,100 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:47,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:47,101 INFO L82 PathProgramCache]: Analyzing trace with hash -1439494560, now seen corresponding path program 20 times [2019-08-05 10:53:47,101 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:47,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:47,394 WARN L254 TraceCheckSpWp]: Trace formula consists of 3469 conjuncts, 3385 conjunts are in the unsatisfiable core [2019-08-05 10:53:47,592 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:56,899 INFO L134 CoverageAnalysis]: Checked inductivity of 5460 backedges. 0 proven. 5460 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:56,900 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:56,900 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:53:56,900 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:53:56,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:53:56,902 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:53:56,902 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:54:06,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:06,094 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:54:06,094 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:54:06,094 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:54:06,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:06,096 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:06,096 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:06,097 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.7s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:54:06,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:06,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:06,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:06,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:54:06,102 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 107 [2019-08-05 10:54:06,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:06,102 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:54:06,102 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:54:06,102 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:54:06,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:54:06,103 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:06,103 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:54:06,104 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:06,104 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:06,104 INFO L82 PathProgramCache]: Analyzing trace with hash 896311392, now seen corresponding path program 21 times [2019-08-05 10:54:06,105 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:06,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:06,468 WARN L254 TraceCheckSpWp]: Trace formula consists of 3733 conjuncts, 3645 conjunts are in the unsatisfiable core [2019-08-05 10:54:06,684 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:17,103 INFO L134 CoverageAnalysis]: Checked inductivity of 6328 backedges. 0 proven. 6328 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:17,103 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:17,103 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:54:17,104 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:54:17,104 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:54:17,104 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:17,104 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:54:27,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:27,608 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:54:27,609 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:54:27,610 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:54:27,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:27,611 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:54:27,611 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:54:27,612 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:27,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:54:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:54:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:54:27,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:54:27,616 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 115 [2019-08-05 10:54:27,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:27,616 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:54:27,616 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:54:27,616 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:54:27,617 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:54:27,617 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:27,617 INFO L399 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2019-08-05 10:54:27,617 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:27,617 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:27,618 INFO L82 PathProgramCache]: Analyzing trace with hash 2129932896, now seen corresponding path program 22 times [2019-08-05 10:54:27,618 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:27,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:27,989 WARN L254 TraceCheckSpWp]: Trace formula consists of 3997 conjuncts, 3905 conjunts are in the unsatisfiable core [2019-08-05 10:54:28,214 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:30,605 WARN L188 SmtUtils]: Spent 312.00 ms on a formula simplification that was a NOOP. DAG size: 16 [2019-08-05 10:54:40,412 INFO L134 CoverageAnalysis]: Checked inductivity of 7260 backedges. 0 proven. 7260 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:54:40,412 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:40,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-08-05 10:54:40,413 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-08-05 10:54:40,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-08-05 10:54:40,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:54:40,414 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2019-08-05 10:54:52,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:52,509 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:54:52,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 10:54:52,510 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2019-08-05 10:54:52,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:52,511 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:54:52,512 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:54:52,513 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 10.3s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:54:52,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:54:52,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:54:52,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:54:52,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:54:52,516 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 123 [2019-08-05 10:54:52,516 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:52,516 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:54:52,517 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-08-05 10:54:52,517 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:54:52,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:54:52,517 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:52,518 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:54:52,518 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:52,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:52,518 INFO L82 PathProgramCache]: Analyzing trace with hash 1489618016, now seen corresponding path program 23 times [2019-08-05 10:54:52,519 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:52,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:52,924 WARN L254 TraceCheckSpWp]: Trace formula consists of 4261 conjuncts, 4134 conjunts are in the unsatisfiable core [2019-08-05 10:54:53,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:06,606 INFO L134 CoverageAnalysis]: Checked inductivity of 8256 backedges. 0 proven. 8256 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:06,606 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:06,606 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:55:06,606 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:55:06,607 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:55:06,607 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:55:06,608 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:55:20,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:20,714 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:55:20,715 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:55:20,715 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:55:20,715 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:20,716 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:55:20,716 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:55:20,717 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 11.3s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:20,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:55:20,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:55:20,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:55:20,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:55:20,720 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 131 [2019-08-05 10:55:20,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:20,720 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:55:20,720 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:55:20,720 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:55:20,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:55:20,721 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:20,721 INFO L399 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2019-08-05 10:55:20,722 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:20,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:20,722 INFO L82 PathProgramCache]: Analyzing trace with hash -1796385184, now seen corresponding path program 24 times [2019-08-05 10:55:20,723 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:21,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:21,140 WARN L254 TraceCheckSpWp]: Trace formula consists of 4525 conjuncts, 4426 conjunts are in the unsatisfiable core [2019-08-05 10:55:21,522 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:21,792 WARN L188 SmtUtils]: Spent 240.00 ms on a formula simplification that was a NOOP. DAG size: 21 [2019-08-05 10:55:37,466 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 9316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:37,466 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:37,466 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [138] total 138 [2019-08-05 10:55:37,467 INFO L454 AbstractCegarLoop]: Interpolant automaton has 139 states [2019-08-05 10:55:37,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 139 interpolants. [2019-08-05 10:55:37,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:55:37,468 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 139 states. [2019-08-05 10:55:53,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:53,128 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:55:53,129 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 139 states. [2019-08-05 10:55:53,129 INFO L78 Accepts]: Start accepts. Automaton has 139 states. Word has length 139 [2019-08-05 10:55:53,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:53,131 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:55:53,131 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:55:53,132 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 138 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 13.5s TimeCoverageRelationStatistics Valid=411, Invalid=18771, Unknown=0, NotChecked=0, Total=19182 [2019-08-05 10:55:53,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:55:53,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:55:53,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:55:53,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:55:53,136 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 139 [2019-08-05 10:55:53,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:53,136 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:55:53,136 INFO L476 AbstractCegarLoop]: Interpolant automaton has 139 states. [2019-08-05 10:55:53,136 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:55:53,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:55:53,137 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:53,137 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:55:53,137 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:53,138 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:53,138 INFO L82 PathProgramCache]: Analyzing trace with hash 90105952, now seen corresponding path program 25 times [2019-08-05 10:55:53,138 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:53,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:53,578 WARN L254 TraceCheckSpWp]: Trace formula consists of 4789 conjuncts, 4686 conjunts are in the unsatisfiable core [2019-08-05 10:55:53,855 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:11,389 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:11,389 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:11,390 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-08-05 10:56:11,390 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-08-05 10:56:11,391 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-08-05 10:56:11,392 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:56:11,392 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. Received shutdown request... [2019-08-05 10:56:18,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:56:18,338 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:56:18,345 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:56:18,345 INFO L202 PluginConnector]: Adding new model CTR_CounterExp-32bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:18 BoogieIcfgContainer [2019-08-05 10:56:18,346 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:18,347 INFO L168 Benchmark]: Toolchain (without parser) took 251725.66 ms. Allocated memory was 140.5 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 108.5 MB in the beginning and 2.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 451.0 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,348 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.24 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 109.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,349 INFO L168 Benchmark]: Boogie Procedure Inliner took 42.32 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 106.5 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:56:18,350 INFO L168 Benchmark]: Boogie Preprocessor took 66.47 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 104.8 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:56:18,350 INFO L168 Benchmark]: RCFGBuilder took 2878.21 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 104.8 MB in the beginning and 54.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 86.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,351 INFO L168 Benchmark]: TraceAbstraction took 248732.18 ms. Allocated memory was 176.7 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 54.8 MB in the beginning and 2.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 361.1 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:18,355 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.24 ms. Allocated memory is still 140.5 MB. Free memory was 110.2 MB in the beginning and 109.9 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 42.32 ms. Allocated memory is still 140.5 MB. Free memory was 108.3 MB in the beginning and 106.5 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.47 ms. Allocated memory is still 140.5 MB. Free memory was 106.5 MB in the beginning and 104.8 MB in the end (delta: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 7.1 GB. * RCFGBuilder took 2878.21 ms. Allocated memory was 140.5 MB in the beginning and 176.7 MB in the end (delta: 36.2 MB). Free memory was 104.8 MB in the beginning and 54.8 MB in the end (delta: 49.9 MB). Peak memory consumption was 86.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 248732.18 ms. Allocated memory was 176.7 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 54.8 MB in the beginning and 2.2 GB in the end (delta: -2.2 GB). Peak memory consumption was 361.1 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 326]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 326). Cancelled while BasicCegarLoop was constructing difference of abstraction (148states) and FLOYD_HOARE automaton (currently 59 states, 147 states before enhancement),while ReachableStatesComputation was computing reachable states (57 states constructedinput type IntersectNwa). - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 248.6s OverallTime, 26 OverallIterations, 144 TraceHistogramMax, 108.4s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 74 SDtfs, 6 SDslu, 38 SDs, 0 SdLazy, 125123 SolverSat, 1306 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 90.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1468 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 1436 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 108.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=148occurred in iteration=25, 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.1s AutomataMinimizationTime, 25 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.8s SsaConstructionTime, 3.7s SatisfiabilityAnalysisTime, 135.1s InterpolantComputationTime, 1479 NumberOfCodeBlocks, 1479 NumberOfCodeBlocksAsserted, 26 NumberOfCheckSat, 1453 ConstructedInterpolants, 0 QuantifiedInterpolants, 2222564 SizeOfPredicates, 862 NumberOfNonLiveVariables, 47195 ConjunctsInSsa, 44943 ConjunctsInUnsatCore, 26 InterpolantComputations, 1 PerfectInterpolantSequences, 7/68306 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown