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/CounterExp-8bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:53:17,754 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:53:17,756 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:53:17,767 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:53:17,768 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:53:17,769 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:53:17,770 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:53:17,772 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:53:17,774 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:53:17,775 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:53:17,776 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:53:17,777 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:53:17,777 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:53:17,778 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:53:17,779 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:53:17,781 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:53:17,781 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:53:17,782 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:53:17,785 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:53:17,787 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:53:17,789 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:53:17,790 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:53:17,791 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:53:17,792 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:53:17,795 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:53:17,795 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:53:17,796 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:53:17,797 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:53:17,797 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:53:17,798 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:53:17,799 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:53:17,800 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:53:17,800 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:53:17,801 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:53:17,803 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:53:17,803 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:53:17,804 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:53:17,804 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:53:17,804 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:53:17,807 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:53:17,807 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:53:17,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:53:17,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:53:17,850 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:53:17,851 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:53:17,852 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:53:17,852 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-8bit.bpl [2019-08-05 10:53:17,853 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-8bit.bpl' [2019-08-05 10:53:17,893 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:53:17,896 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:53:17,897 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:17,897 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:53:17,897 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:53:17,916 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,926 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,933 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:53:17,933 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:53:17,933 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:53:17,935 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:17,936 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:53:17,936 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:53:17,936 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:53:17,948 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,948 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,949 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,949 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,954 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,962 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,965 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/1) ... [2019-08-05 10:53:17,967 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:53:17,968 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:53:17,968 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:53:17,968 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:53:17,969 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (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:53:18,041 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:53:18,041 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:53:18,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:53:18,917 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:53:18,918 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:53:18,919 INFO L202 PluginConnector]: Adding new model CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:18 BoogieIcfgContainer [2019-08-05 10:53:18,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:53:18,921 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:53:18,921 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:53:18,924 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:53:18,925 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:17" (1/2) ... [2019-08-05 10:53:18,926 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cffe13e and model type CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:53:18, skipping insertion in model container [2019-08-05 10:53:18,926 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:18" (2/2) ... [2019-08-05 10:53:18,928 INFO L109 eAbstractionObserver]: Analyzing ICFG CounterExp-8bit.bpl [2019-08-05 10:53:18,937 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:53:18,945 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:53:18,961 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:53:18,987 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:53:18,988 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:53:18,988 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:53:18,988 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:53:18,988 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:53:18,989 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:53:18,989 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:53:18,989 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:53:18,989 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:53:19,002 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:53:19,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:53:19,011 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:19,012 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:53:19,016 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:19,025 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:19,026 INFO L82 PathProgramCache]: Analyzing trace with hash 32864, now seen corresponding path program 1 times [2019-08-05 10:53:19,079 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:19,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:19,098 INFO L256 TraceCheckSpWp]: Trace formula consists of 13 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:53:19,102 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,146 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:53:19,148 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:53:19,149 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:53:19,152 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:53:19,162 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:53:19,163 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:53:19,165 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:53:19,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:19,234 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:19,234 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:53:19,236 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:53:19,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:19,247 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:19,250 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:53:19,252 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:53:19,271 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:53:19,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:53:19,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:53:19,285 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:53:19,286 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:53:19,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:19,287 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:53:19,287 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:53:19,287 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:53:19,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:53:19,287 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:19,287 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:53:19,288 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:19,288 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:19,288 INFO L82 PathProgramCache]: Analyzing trace with hash 1051524, now seen corresponding path program 1 times [2019-08-05 10:53:19,289 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:19,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:19,308 INFO L256 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:53:19,310 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,406 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:53:19,406 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:19,406 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:53:19,408 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:53:19,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:53:19,409 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:53:19,409 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:53:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:19,496 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:19,496 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:53:19,497 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:53:19,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:19,498 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:19,498 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:53:19,501 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:53:19,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:53:19,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:53:19,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:53:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:53:19,504 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:53:19,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:19,504 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:53:19,505 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:53:19,505 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:53:19,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:53:19,506 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:19,506 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:53:19,506 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:19,506 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:19,506 INFO L82 PathProgramCache]: Analyzing trace with hash 32629984, now seen corresponding path program 2 times [2019-08-05 10:53:19,507 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:19,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:19,558 INFO L256 TraceCheckSpWp]: Trace formula consists of 31 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 10:53:19,561 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:19,694 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:53:19,694 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:19,695 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:19,695 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:19,695 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:19,696 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:19,696 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:53:19,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:19,828 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:53:19,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:19,830 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:53:19,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:19,831 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:53:19,831 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:53:19,832 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:19,833 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:53:19,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:53:19,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:53:19,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:53:19,836 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:53:19,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:19,836 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:53:19,837 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:19,837 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:53:19,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:53:19,837 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:19,837 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:53:19,838 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:19,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:19,838 INFO L82 PathProgramCache]: Analyzing trace with hash 1011562244, now seen corresponding path program 3 times [2019-08-05 10:53:19,840 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:19,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:19,898 WARN L254 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 22 conjunts are in the unsatisfiable core [2019-08-05 10:53:19,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:20,038 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:53:20,184 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:53:20,184 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:20,184 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 10:53:20,185 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:53:20,185 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:53:20,185 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:20,186 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:53:20,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:20,260 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:53:20,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:53:20,261 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:53:20,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:20,262 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:53:20,262 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:53:20,263 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:53:20,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:53:20,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:53:20,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:53:20,265 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:53:20,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:20,265 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:53:20,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:53:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:53:20,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:53:20,266 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:20,266 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:53:20,267 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:20,267 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:20,267 INFO L82 PathProgramCache]: Analyzing trace with hash 1293691232, now seen corresponding path program 4 times [2019-08-05 10:53:20,268 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:20,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:20,289 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:53:20,302 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:20,534 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:53:20,534 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:20,535 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:53:20,535 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:53:20,535 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:53:20,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:20,536 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:53:20,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:20,919 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:53:20,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:20,921 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:53:20,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:20,922 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:53:20,922 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:53:20,923 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:53:20,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:53:20,925 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:53:20,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:53:20,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:53:20,926 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:53:20,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:20,926 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:53:20,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:53:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:53:20,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:53:20,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:20,927 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:53:20,927 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:20,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:20,927 INFO L82 PathProgramCache]: Analyzing trace with hash 1449755268, now seen corresponding path program 5 times [2019-08-05 10:53:20,928 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:20,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:20,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 15 conjunts are in the unsatisfiable core [2019-08-05 10:53:20,954 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:21,071 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:53:21,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:21,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:21,073 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:21,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:21,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:21,073 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:53:21,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:21,350 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:53:21,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:21,351 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:53:21,352 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:21,352 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:53:21,352 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:53:21,353 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:21,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:53:21,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:53:21,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:53:21,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:53:21,356 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:53:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:21,356 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:53:21,356 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:21,356 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:53:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:53:21,357 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:21,357 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:53:21,357 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 1992773088, now seen corresponding path program 6 times [2019-08-05 10:53:21,359 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:21,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:21,377 WARN L254 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 49 conjunts are in the unsatisfiable core [2019-08-05 10:53:21,391 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:21,684 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:21,685 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:21,685 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8] total 8 [2019-08-05 10:53:21,685 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 10:53:21,686 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 10:53:21,686 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-08-05 10:53:21,686 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 9 states. [2019-08-05 10:53:21,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:21,785 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:53:21,787 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-08-05 10:53:21,787 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 9 [2019-08-05 10:53:21,788 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:21,788 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:53:21,788 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:53:21,789 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:53:21,789 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:53:21,790 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:53:21,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:53:21,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:53:21,791 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:53:21,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:21,792 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:53:21,792 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 10:53:21,792 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:53:21,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:53:21,792 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:21,793 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:53:21,793 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:21,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:21,794 INFO L82 PathProgramCache]: Analyzing trace with hash -499428768, now seen corresponding path program 7 times [2019-08-05 10:53:21,794 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:21,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:21,813 WARN L254 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 74 conjunts are in the unsatisfiable core [2019-08-05 10:53:21,828 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:22,347 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:53:22,348 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:22,348 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:53:22,348 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:53:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:53:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:22,349 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:53:22,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:22,498 INFO L93 Difference]: Finished difference Result 14 states and 14 transitions. [2019-08-05 10:53:22,499 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:22,499 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:53:22,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:22,500 INFO L225 Difference]: With dead ends: 14 [2019-08-05 10:53:22,500 INFO L226 Difference]: Without dead ends: 14 [2019-08-05 10:53:22,501 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:22,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14 states. [2019-08-05 10:53:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14 to 14. [2019-08-05 10:53:22,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2019-08-05 10:53:22,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 14 transitions. [2019-08-05 10:53:22,503 INFO L78 Accepts]: Start accepts. Automaton has 14 states and 14 transitions. Word has length 11 [2019-08-05 10:53:22,504 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:22,504 INFO L475 AbstractCegarLoop]: Abstraction has 14 states and 14 transitions. [2019-08-05 10:53:22,504 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:53:22,504 INFO L276 IsEmpty]: Start isEmpty. Operand 14 states and 14 transitions. [2019-08-05 10:53:22,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-08-05 10:53:22,504 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:22,504 INFO L399 BasicCegarLoop]: trace histogram [10, 1, 1, 1] [2019-08-05 10:53:22,505 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:22,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:22,505 INFO L82 PathProgramCache]: Analyzing trace with hash 1086338784, now seen corresponding path program 8 times [2019-08-05 10:53:22,506 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:22,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:22,527 INFO L256 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 34 conjunts are in the unsatisfiable core [2019-08-05 10:53:22,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:22,717 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 49 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 10:53:22,718 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:22,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:53:22,718 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:53:22,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:53:22,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:53:22,719 INFO L87 Difference]: Start difference. First operand 14 states and 14 transitions. Second operand 8 states. [2019-08-05 10:53:22,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:22,790 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:53:22,790 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:22,791 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 13 [2019-08-05 10:53:22,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:22,792 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:53:22,792 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:53:22,793 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:22,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:53:22,794 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:53:22,795 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:53:22,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:53:22,795 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 13 [2019-08-05 10:53:22,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:22,796 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:53:22,796 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:53:22,796 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:53:22,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:53:22,796 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:22,797 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:53:22,797 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:22,797 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:22,797 INFO L82 PathProgramCache]: Analyzing trace with hash 295566176, now seen corresponding path program 9 times [2019-08-05 10:53:22,798 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:22,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:22,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 51 conjunts are in the unsatisfiable core [2019-08-05 10:53:22,836 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:23,068 INFO L134 CoverageAnalysis]: Checked inductivity of 78 backedges. 0 proven. 75 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2019-08-05 10:53:23,069 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:23,069 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:53:23,070 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:53:23,070 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:53:23,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:53:23,071 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-08-05 10:53:23,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:23,294 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:53:23,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:23,294 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:53:23,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:23,295 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:53:23,295 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:53:23,296 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:23,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:53:23,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:53:23,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:53:23,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:53:23,299 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:53:23,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:23,300 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:53:23,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:53:23,300 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:53:23,300 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:53:23,300 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:23,301 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:53:23,301 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:23,301 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:23,301 INFO L82 PathProgramCache]: Analyzing trace with hash 226763872, now seen corresponding path program 10 times [2019-08-05 10:53:23,302 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:23,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:23,331 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 143 conjunts are in the unsatisfiable core [2019-08-05 10:53:23,349 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:23,535 WARN L188 SmtUtils]: Spent 159.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:53:24,052 WARN L188 SmtUtils]: Spent 201.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:24,416 WARN L188 SmtUtils]: Spent 194.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:24,810 WARN L188 SmtUtils]: Spent 195.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:53:25,216 WARN L188 SmtUtils]: Spent 192.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:53:25,655 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:53:25,656 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:25,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:53:25,656 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:53:25,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:53:25,657 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:25,658 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:53:25,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:25,899 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:53:25,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:53:25,904 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:53:25,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:25,905 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:53:25,905 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:53:25,906 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:25,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:53:25,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:53:25,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:53:25,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:53:25,910 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:53:25,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:25,910 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:53:25,910 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:53:25,910 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:53:25,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:53:25,911 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:25,911 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:53:25,911 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:25,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:25,912 INFO L82 PathProgramCache]: Analyzing trace with hash -1814366624, now seen corresponding path program 11 times [2019-08-05 10:53:25,913 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:25,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:25,956 WARN L254 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 211 conjunts are in the unsatisfiable core [2019-08-05 10:53:25,974 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:26,126 WARN L188 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 15 [2019-08-05 10:53:27,413 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:53:27,414 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:27,414 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [26] total 26 [2019-08-05 10:53:27,415 INFO L454 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-08-05 10:53:27,415 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-08-05 10:53:27,415 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:53:27,416 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 27 states. [2019-08-05 10:53:28,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:28,212 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:53:28,212 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2019-08-05 10:53:28,212 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 27 [2019-08-05 10:53:28,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:28,214 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:53:28,214 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:53:28,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=75, Invalid=627, Unknown=0, NotChecked=0, Total=702 [2019-08-05 10:53:28,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:53:28,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:53:28,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:53:28,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:53:28,219 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:53:28,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:28,220 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:53:28,220 INFO L476 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-08-05 10:53:28,220 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:53:28,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:53:28,221 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:28,221 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:53:28,221 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:28,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:28,222 INFO L82 PathProgramCache]: Analyzing trace with hash -2025863072, now seen corresponding path program 12 times [2019-08-05 10:53:28,222 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:28,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:28,270 WARN L254 TraceCheckSpWp]: Trace formula consists of 301 conjuncts, 280 conjunts are in the unsatisfiable core [2019-08-05 10:53:28,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:29,458 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:53:29,459 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:29,459 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:53:29,459 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:53:29,459 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:53:29,460 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:53:29,460 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:53:30,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:30,293 INFO L93 Difference]: Finished difference Result 44 states and 44 transitions. [2019-08-05 10:53:30,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:53:30,294 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:53:30,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:30,294 INFO L225 Difference]: With dead ends: 44 [2019-08-05 10:53:30,295 INFO L226 Difference]: Without dead ends: 44 [2019-08-05 10:53:30,295 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:53:30,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2019-08-05 10:53:30,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2019-08-05 10:53:30,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2019-08-05 10:53:30,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2019-08-05 10:53:30,300 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 35 [2019-08-05 10:53:30,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:30,300 INFO L475 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2019-08-05 10:53:30,300 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:53:30,300 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2019-08-05 10:53:30,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2019-08-05 10:53:30,301 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:30,302 INFO L399 BasicCegarLoop]: trace histogram [40, 1, 1, 1] [2019-08-05 10:53:30,302 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:30,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:30,302 INFO L82 PathProgramCache]: Analyzing trace with hash -105735584, now seen corresponding path program 13 times [2019-08-05 10:53:30,303 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:30,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:30,363 WARN L254 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 348 conjunts are in the unsatisfiable core [2019-08-05 10:53:30,386 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:31,868 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:53:31,868 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:31,868 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [42] total 42 [2019-08-05 10:53:31,869 INFO L454 AbstractCegarLoop]: Interpolant automaton has 43 states [2019-08-05 10:53:31,869 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2019-08-05 10:53:31,870 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:53:31,870 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 43 states. [2019-08-05 10:53:33,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:33,300 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:53:33,300 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 43 states. [2019-08-05 10:53:33,300 INFO L78 Accepts]: Start accepts. Automaton has 43 states. Word has length 43 [2019-08-05 10:53:33,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:33,302 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:53:33,302 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:53:33,304 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=123, Invalid=1683, Unknown=0, NotChecked=0, Total=1806 [2019-08-05 10:53:33,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:53:33,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:53:33,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:53:33,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:53:33,309 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 43 [2019-08-05 10:53:33,309 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:33,309 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:53:33,309 INFO L476 AbstractCegarLoop]: Interpolant automaton has 43 states. [2019-08-05 10:53:33,309 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:53:33,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:53:33,310 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:33,311 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:53:33,311 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:33,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:33,311 INFO L82 PathProgramCache]: Analyzing trace with hash -46961568, now seen corresponding path program 14 times [2019-08-05 10:53:33,312 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:33,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:33,373 WARN L254 TraceCheckSpWp]: Trace formula consists of 445 conjuncts, 416 conjunts are in the unsatisfiable core [2019-08-05 10:53:33,400 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:35,244 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:53:35,244 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:35,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:53:35,245 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:53:35,246 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:53:35,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:53:35,247 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:53:37,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:37,533 INFO L93 Difference]: Finished difference Result 60 states and 60 transitions. [2019-08-05 10:53:37,534 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:53:37,534 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:53:37,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:37,535 INFO L225 Difference]: With dead ends: 60 [2019-08-05 10:53:37,535 INFO L226 Difference]: Without dead ends: 60 [2019-08-05 10:53:37,536 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:53:37,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2019-08-05 10:53:37,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2019-08-05 10:53:37,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2019-08-05 10:53:37,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 60 transitions. [2019-08-05 10:53:37,541 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 60 transitions. Word has length 51 [2019-08-05 10:53:37,541 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:37,541 INFO L475 AbstractCegarLoop]: Abstraction has 60 states and 60 transitions. [2019-08-05 10:53:37,541 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:53:37,541 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 60 transitions. [2019-08-05 10:53:37,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-08-05 10:53:37,543 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:37,543 INFO L399 BasicCegarLoop]: trace histogram [56, 1, 1, 1] [2019-08-05 10:53:37,543 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:37,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:37,544 INFO L82 PathProgramCache]: Analyzing trace with hash -1547551136, now seen corresponding path program 15 times [2019-08-05 10:53:37,544 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:37,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:37,618 WARN L254 TraceCheckSpWp]: Trace formula consists of 517 conjuncts, 477 conjunts are in the unsatisfiable core [2019-08-05 10:53:37,653 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:40,083 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:53:40,083 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:40,083 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [58] total 58 [2019-08-05 10:53:40,084 INFO L454 AbstractCegarLoop]: Interpolant automaton has 59 states [2019-08-05 10:53:40,084 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2019-08-05 10:53:40,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=225, Invalid=3197, Unknown=0, NotChecked=0, Total=3422 [2019-08-05 10:53:40,085 INFO L87 Difference]: Start difference. First operand 60 states and 60 transitions. Second operand 59 states. [2019-08-05 10:53:42,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:42,204 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:53:42,205 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 59 states. [2019-08-05 10:53:42,205 INFO L78 Accepts]: Start accepts. Automaton has 59 states. Word has length 59 [2019-08-05 10:53:42,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:42,206 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:53:42,206 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:53:42,208 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=284, Invalid=3256, Unknown=0, NotChecked=0, Total=3540 [2019-08-05 10:53:42,208 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:53:42,212 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:53:42,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:53:42,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:53:42,213 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 59 [2019-08-05 10:53:42,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:42,213 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:53:42,214 INFO L476 AbstractCegarLoop]: Interpolant automaton has 59 states. [2019-08-05 10:53:42,214 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:53:42,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:53:42,215 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:42,215 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:53:42,215 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:42,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:42,216 INFO L82 PathProgramCache]: Analyzing trace with hash -10547104, now seen corresponding path program 16 times [2019-08-05 10:53:42,216 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:42,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:42,287 WARN L254 TraceCheckSpWp]: Trace formula consists of 589 conjuncts, 545 conjunts are in the unsatisfiable core [2019-08-05 10:53:42,320 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:45,557 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:53:45,558 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:45,558 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:53:45,560 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:53:45,560 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:53:45,561 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=257, Invalid=4165, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:53:45,561 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:53:48,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:48,559 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2019-08-05 10:53:48,559 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:53:48,559 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:53:48,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:48,560 INFO L225 Difference]: With dead ends: 76 [2019-08-05 10:53:48,560 INFO L226 Difference]: Without dead ends: 76 [2019-08-05 10:53:48,563 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.1s TimeCoverageRelationStatistics Valid=324, Invalid=4232, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:53:48,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2019-08-05 10:53:48,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2019-08-05 10:53:48,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2019-08-05 10:53:48,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2019-08-05 10:53:48,568 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 67 [2019-08-05 10:53:48,568 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:48,568 INFO L475 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2019-08-05 10:53:48,568 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:53:48,568 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2019-08-05 10:53:48,569 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2019-08-05 10:53:48,570 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:48,570 INFO L399 BasicCegarLoop]: trace histogram [72, 1, 1, 1] [2019-08-05 10:53:48,570 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:48,570 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:48,570 INFO L82 PathProgramCache]: Analyzing trace with hash 571073120, now seen corresponding path program 17 times [2019-08-05 10:53:48,571 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:48,636 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:48,653 WARN L254 TraceCheckSpWp]: Trace formula consists of 661 conjuncts, 621 conjunts are in the unsatisfiable core [2019-08-05 10:53:48,690 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:48,822 WARN L188 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 19 [2019-08-05 10:53:52,848 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:53:52,849 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:52,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [74] total 74 [2019-08-05 10:53:52,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 75 states [2019-08-05 10:53:52,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 75 interpolants. [2019-08-05 10:53:52,851 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:52,852 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 75 states. [2019-08-05 10:53:56,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:56,465 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:53:56,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 75 states. [2019-08-05 10:53:56,465 INFO L78 Accepts]: Start accepts. Automaton has 75 states. Word has length 75 [2019-08-05 10:53:56,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:56,466 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:53:56,467 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:53:56,469 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 73 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=219, Invalid=5331, Unknown=0, NotChecked=0, Total=5550 [2019-08-05 10:53:56,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:53:56,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:53:56,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:53:56,474 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:53:56,475 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 75 [2019-08-05 10:53:56,475 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:56,475 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:53:56,475 INFO L476 AbstractCegarLoop]: Interpolant automaton has 75 states. [2019-08-05 10:53:56,475 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:53:56,476 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:53:56,476 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:56,477 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:53:56,477 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:56,477 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:56,477 INFO L82 PathProgramCache]: Analyzing trace with hash 499299424, now seen corresponding path program 18 times [2019-08-05 10:53:56,478 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:56,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:56,547 WARN L254 TraceCheckSpWp]: Trace formula consists of 733 conjuncts, 689 conjunts are in the unsatisfiable core [2019-08-05 10:53:56,602 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:01,648 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:54:01,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:01,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:54:01,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:54:01,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:54:01,651 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:54:01,652 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:54:06,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:06,164 INFO L93 Difference]: Finished difference Result 92 states and 92 transitions. [2019-08-05 10:54:06,164 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:54:06,164 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:54:06,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:06,165 INFO L225 Difference]: With dead ends: 92 [2019-08-05 10:54:06,165 INFO L226 Difference]: Without dead ends: 92 [2019-08-05 10:54:06,168 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:54:06,169 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2019-08-05 10:54:06,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2019-08-05 10:54:06,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-08-05 10:54:06,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 92 transitions. [2019-08-05 10:54:06,173 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 92 transitions. Word has length 83 [2019-08-05 10:54:06,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:06,174 INFO L475 AbstractCegarLoop]: Abstraction has 92 states and 92 transitions. [2019-08-05 10:54:06,174 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:54:06,174 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 92 transitions. [2019-08-05 10:54:06,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2019-08-05 10:54:06,175 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:06,175 INFO L399 BasicCegarLoop]: trace histogram [88, 1, 1, 1] [2019-08-05 10:54:06,175 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:06,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:06,176 INFO L82 PathProgramCache]: Analyzing trace with hash 76121696, now seen corresponding path program 19 times [2019-08-05 10:54:06,176 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:06,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:06,248 WARN L254 TraceCheckSpWp]: Trace formula consists of 805 conjuncts, 757 conjunts are in the unsatisfiable core [2019-08-05 10:54:06,303 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:11,668 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:54:11,668 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:11,668 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [90] total 90 [2019-08-05 10:54:11,669 INFO L454 AbstractCegarLoop]: Interpolant automaton has 91 states [2019-08-05 10:54:11,669 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 91 interpolants. [2019-08-05 10:54:11,671 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:54:11,671 INFO L87 Difference]: Start difference. First operand 92 states and 92 transitions. Second operand 91 states. [2019-08-05 10:54:17,197 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:17,197 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:54:17,198 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 91 states. [2019-08-05 10:54:17,198 INFO L78 Accepts]: Start accepts. Automaton has 91 states. Word has length 91 [2019-08-05 10:54:17,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:17,199 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:54:17,199 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:54:17,200 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=267, Invalid=7923, Unknown=0, NotChecked=0, Total=8190 [2019-08-05 10:54:17,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:54:17,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:54:17,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:54:17,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:54:17,205 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 91 [2019-08-05 10:54:17,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:17,206 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:54:17,206 INFO L476 AbstractCegarLoop]: Interpolant automaton has 91 states. [2019-08-05 10:54:17,206 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:54:17,207 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:54:17,207 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:17,207 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:54:17,207 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:17,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:17,208 INFO L82 PathProgramCache]: Analyzing trace with hash -396470176, now seen corresponding path program 20 times [2019-08-05 10:54:17,208 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:17,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:17,304 WARN L254 TraceCheckSpWp]: Trace formula consists of 877 conjuncts, 825 conjunts are in the unsatisfiable core [2019-08-05 10:54:17,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:23,511 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:54:23,511 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:23,511 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:54:23,512 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:54:23,512 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:54:23,513 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:23,513 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:54:29,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:29,917 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2019-08-05 10:54:29,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:54:29,918 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:54:29,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:29,919 INFO L225 Difference]: With dead ends: 108 [2019-08-05 10:54:29,919 INFO L226 Difference]: Without dead ends: 108 [2019-08-05 10:54:29,921 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.8s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:29,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2019-08-05 10:54:29,924 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2019-08-05 10:54:29,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 108 states. [2019-08-05 10:54:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 108 transitions. [2019-08-05 10:54:29,925 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 108 transitions. Word has length 99 [2019-08-05 10:54:29,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:29,926 INFO L475 AbstractCegarLoop]: Abstraction has 108 states and 108 transitions. [2019-08-05 10:54:29,926 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:54:29,926 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 108 transitions. [2019-08-05 10:54:29,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2019-08-05 10:54:29,927 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:29,927 INFO L399 BasicCegarLoop]: trace histogram [104, 1, 1, 1] [2019-08-05 10:54:29,927 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:29,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:29,928 INFO L82 PathProgramCache]: Analyzing trace with hash -616486304, now seen corresponding path program 21 times [2019-08-05 10:54:29,929 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:30,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:30,044 WARN L254 TraceCheckSpWp]: Trace formula consists of 949 conjuncts, 893 conjunts are in the unsatisfiable core [2019-08-05 10:54:30,100 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:37,209 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:54:37,209 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:37,209 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [106] total 106 [2019-08-05 10:54:37,209 INFO L454 AbstractCegarLoop]: Interpolant automaton has 107 states [2019-08-05 10:54:37,210 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 107 interpolants. [2019-08-05 10:54:37,210 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:54:37,210 INFO L87 Difference]: Start difference. First operand 108 states and 108 transitions. Second operand 107 states. [2019-08-05 10:54:44,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:44,869 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:54:44,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 107 states. [2019-08-05 10:54:44,873 INFO L78 Accepts]: Start accepts. Automaton has 107 states. Word has length 107 [2019-08-05 10:54:44,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:44,873 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:44,874 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:44,875 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 106 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.7s TimeCoverageRelationStatistics Valid=315, Invalid=11027, Unknown=0, NotChecked=0, Total=11342 [2019-08-05 10:54:44,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:44,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:44,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:44,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:54:44,879 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 107 [2019-08-05 10:54:44,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:44,880 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:54:44,880 INFO L476 AbstractCegarLoop]: Interpolant automaton has 107 states. [2019-08-05 10:54:44,880 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:54:44,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:54:44,881 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:44,881 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:54:44,881 INFO L418 AbstractCegarLoop]: === Iteration 23 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:44,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:44,882 INFO L82 PathProgramCache]: Analyzing trace with hash -281936800, now seen corresponding path program 22 times [2019-08-05 10:54:44,882 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:44,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:44,979 WARN L254 TraceCheckSpWp]: Trace formula consists of 1021 conjuncts, 961 conjunts are in the unsatisfiable core [2019-08-05 10:54:45,042 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:52,925 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:52,925 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:52,925 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:54:52,925 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:54:52,926 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:54:52,926 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:52,927 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:55:01,967 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:01,967 INFO L93 Difference]: Finished difference Result 124 states and 124 transitions. [2019-08-05 10:55:01,968 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:55:01,968 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:55:01,968 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:01,969 INFO L225 Difference]: With dead ends: 124 [2019-08-05 10:55:01,969 INFO L226 Difference]: Without dead ends: 124 [2019-08-05 10:55:01,970 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:55:01,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2019-08-05 10:55:01,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 124. [2019-08-05 10:55:01,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 124 states. [2019-08-05 10:55:01,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 124 transitions. [2019-08-05 10:55:01,973 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 124 transitions. Word has length 115 [2019-08-05 10:55:01,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:01,974 INFO L475 AbstractCegarLoop]: Abstraction has 124 states and 124 transitions. [2019-08-05 10:55:01,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:55:01,974 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 124 transitions. [2019-08-05 10:55:01,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2019-08-05 10:55:01,975 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:01,975 INFO L399 BasicCegarLoop]: trace histogram [120, 1, 1, 1] [2019-08-05 10:55:01,976 INFO L418 AbstractCegarLoop]: === Iteration 24 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:01,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:01,976 INFO L82 PathProgramCache]: Analyzing trace with hash 909168224, now seen corresponding path program 23 times [2019-08-05 10:55:01,977 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:02,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:02,088 WARN L254 TraceCheckSpWp]: Trace formula consists of 1093 conjuncts, 1029 conjunts are in the unsatisfiable core [2019-08-05 10:55:02,152 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:11,599 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:55:11,599 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:11,599 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [122] total 122 [2019-08-05 10:55:11,600 INFO L454 AbstractCegarLoop]: Interpolant automaton has 123 states [2019-08-05 10:55:11,600 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 123 interpolants. [2019-08-05 10:55:11,601 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:55:11,601 INFO L87 Difference]: Start difference. First operand 124 states and 124 transitions. Second operand 123 states. [2019-08-05 10:55:21,377 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:21,377 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:55:21,378 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2019-08-05 10:55:21,378 INFO L78 Accepts]: Start accepts. Automaton has 123 states. Word has length 123 [2019-08-05 10:55:21,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:21,380 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:55:21,380 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:55:21,381 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 121 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.0s TimeCoverageRelationStatistics Valid=363, Invalid=14643, Unknown=0, NotChecked=0, Total=15006 [2019-08-05 10:55:21,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:55:21,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:55:21,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:55:21,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:55:21,384 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 123 [2019-08-05 10:55:21,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:21,385 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:55:21,385 INFO L476 AbstractCegarLoop]: Interpolant automaton has 123 states. [2019-08-05 10:55:21,385 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:55:21,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:55:21,386 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:21,386 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:55:21,386 INFO L418 AbstractCegarLoop]: === Iteration 25 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:21,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:21,386 INFO L82 PathProgramCache]: Analyzing trace with hash -1036148640, now seen corresponding path program 24 times [2019-08-05 10:55:21,387 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:21,498 WARN L254 TraceCheckSpWp]: Trace formula consists of 1165 conjuncts, 1090 conjunts are in the unsatisfiable core [2019-08-05 10:55:21,574 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:31,434 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:31,434 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:31,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:55:31,435 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:55:31,435 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:55:31,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:55:31,436 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:55:42,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:42,589 INFO L93 Difference]: Finished difference Result 140 states and 140 transitions. [2019-08-05 10:55:42,590 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:55:42,590 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:55:42,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:42,591 INFO L225 Difference]: With dead ends: 140 [2019-08-05 10:55:42,592 INFO L226 Difference]: Without dead ends: 140 [2019-08-05 10:55:42,593 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:55:42,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2019-08-05 10:55:42,595 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2019-08-05 10:55:42,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 140 states. [2019-08-05 10:55:42,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 140 transitions. [2019-08-05 10:55:42,596 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 140 transitions. Word has length 131 [2019-08-05 10:55:42,597 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:42,597 INFO L475 AbstractCegarLoop]: Abstraction has 140 states and 140 transitions. [2019-08-05 10:55:42,597 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:55:42,597 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 140 transitions. [2019-08-05 10:55:42,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2019-08-05 10:55:42,598 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:42,598 INFO L399 BasicCegarLoop]: trace histogram [136, 1, 1, 1] [2019-08-05 10:55:42,598 INFO L418 AbstractCegarLoop]: === Iteration 26 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:42,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:42,598 INFO L82 PathProgramCache]: Analyzing trace with hash -1520930208, now seen corresponding path program 25 times [2019-08-05 10:55:42,599 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:42,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:42,688 WARN L254 TraceCheckSpWp]: Trace formula consists of 1237 conjuncts, 621 conjunts are in the unsatisfiable core [2019-08-05 10:55:42,727 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:43,097 INFO L134 CoverageAnalysis]: Checked inductivity of 9316 backedges. 0 proven. 8812 refuted. 0 times theorem prover too weak. 504 trivial. 0 not checked. [2019-08-05 10:55:43,097 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:43,097 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:55:43,098 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:55:43,098 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:55:43,098 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:55:43,098 INFO L87 Difference]: Start difference. First operand 140 states and 140 transitions. Second operand 20 states. [2019-08-05 10:55:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:43,554 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:55:43,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:55:43,554 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 139 [2019-08-05 10:55:43,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:43,556 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:55:43,556 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:55:43,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 153 GetRequests, 120 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:55:43,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:55:43,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:55:43,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:55:43,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:55:43,560 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 139 [2019-08-05 10:55:43,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:43,561 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:55:43,561 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:55:43,561 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:55:43,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:55:43,562 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:43,562 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:55:43,562 INFO L418 AbstractCegarLoop]: === Iteration 27 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:43,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:43,563 INFO L82 PathProgramCache]: Analyzing trace with hash -243186592, now seen corresponding path program 26 times [2019-08-05 10:55:43,563 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:43,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:43,661 WARN L254 TraceCheckSpWp]: Trace formula consists of 1309 conjuncts, 801 conjunts are in the unsatisfiable core [2019-08-05 10:55:43,716 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:44,815 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10188 refuted. 0 times theorem prover too weak. 252 trivial. 0 not checked. [2019-08-05 10:55:44,815 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:44,815 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [35] total 35 [2019-08-05 10:55:44,816 INFO L454 AbstractCegarLoop]: Interpolant automaton has 36 states [2019-08-05 10:55:44,816 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2019-08-05 10:55:44,816 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=1189, Unknown=0, NotChecked=0, Total=1260 [2019-08-05 10:55:44,816 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 36 states. [2019-08-05 10:55:46,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:46,426 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:55:46,429 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:55:46,429 INFO L78 Accepts]: Start accepts. Automaton has 36 states. Word has length 147 [2019-08-05 10:55:46,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:46,430 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:55:46,430 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:55:46,431 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:55:46,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:55:46,433 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:55:46,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:55:46,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:55:46,434 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 147 [2019-08-05 10:55:46,434 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:46,434 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:55:46,434 INFO L476 AbstractCegarLoop]: Interpolant automaton has 36 states. [2019-08-05 10:55:46,434 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:55:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:55:46,435 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:46,435 INFO L399 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2019-08-05 10:55:46,436 INFO L418 AbstractCegarLoop]: === Iteration 28 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:46,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash 217901152, now seen corresponding path program 27 times [2019-08-05 10:55:46,437 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:46,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:46,620 WARN L254 TraceCheckSpWp]: Trace formula consists of 1453 conjuncts, 1049 conjunts are in the unsatisfiable core [2019-08-05 10:55:46,702 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:49,143 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12754 refuted. 0 times theorem prover too weak. 126 trivial. 0 not checked. [2019-08-05 10:55:49,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:49,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [67] total 67 [2019-08-05 10:55:49,144 INFO L454 AbstractCegarLoop]: Interpolant automaton has 68 states [2019-08-05 10:55:49,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2019-08-05 10:55:49,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=135, Invalid=4421, Unknown=0, NotChecked=0, Total=4556 [2019-08-05 10:55:49,144 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 68 states. [2019-08-05 10:55:54,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:54,445 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:55:54,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:55:54,445 INFO L78 Accepts]: Start accepts. Automaton has 68 states. Word has length 163 [2019-08-05 10:55:54,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:54,447 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:55:54,447 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:55:54,448 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 129 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1953 ImplicationChecksByTransitivity, 4.5s TimeCoverageRelationStatistics Valid=387, Invalid=16643, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:55:54,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:55:54,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:55:54,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:55:54,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:55:54,452 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 163 [2019-08-05 10:55:54,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:54,453 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:55:54,453 INFO L476 AbstractCegarLoop]: Interpolant automaton has 68 states. [2019-08-05 10:55:54,453 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:55:54,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:55:54,454 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:54,454 INFO L399 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2019-08-05 10:55:54,454 INFO L418 AbstractCegarLoop]: === Iteration 29 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:54,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:54,455 INFO L82 PathProgramCache]: Analyzing trace with hash 1218195552, now seen corresponding path program 28 times [2019-08-05 10:55:54,455 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:54,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:54,596 WARN L254 TraceCheckSpWp]: Trace formula consists of 1741 conjuncts, 1449 conjunts are in the unsatisfiable core [2019-08-05 10:55:54,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:03,546 INFO L134 CoverageAnalysis]: Checked inductivity of 18528 backedges. 0 proven. 18465 refuted. 0 times theorem prover too weak. 63 trivial. 0 not checked. [2019-08-05 10:56:03,546 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:03,546 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:56:03,547 INFO L454 AbstractCegarLoop]: Interpolant automaton has 132 states [2019-08-05 10:56:03,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 132 interpolants. [2019-08-05 10:56:03,548 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=263, Invalid=17029, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:56:03,548 INFO L87 Difference]: Start difference. First operand 196 states and 196 transitions. Second operand 132 states. [2019-08-05 10:56:23,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:23,513 INFO L93 Difference]: Finished difference Result 260 states and 260 transitions. [2019-08-05 10:56:23,513 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:56:23,513 INFO L78 Accepts]: Start accepts. Automaton has 132 states. Word has length 195 [2019-08-05 10:56:23,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:23,515 INFO L225 Difference]: With dead ends: 260 [2019-08-05 10:56:23,515 INFO L226 Difference]: Without dead ends: 260 [2019-08-05 10:56:23,519 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 321 GetRequests, 64 SyntacticMatches, 0 SemanticMatches, 257 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8001 ImplicationChecksByTransitivity, 17.1s TimeCoverageRelationStatistics Valid=771, Invalid=66051, Unknown=0, NotChecked=0, Total=66822 [2019-08-05 10:56:23,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 260 states. [2019-08-05 10:56:23,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 260 to 260. [2019-08-05 10:56:23,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 260 states. [2019-08-05 10:56:23,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 260 states to 260 states and 260 transitions. [2019-08-05 10:56:23,523 INFO L78 Accepts]: Start accepts. Automaton has 260 states and 260 transitions. Word has length 195 [2019-08-05 10:56:23,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:23,523 INFO L475 AbstractCegarLoop]: Abstraction has 260 states and 260 transitions. [2019-08-05 10:56:23,523 INFO L476 AbstractCegarLoop]: Interpolant automaton has 132 states. [2019-08-05 10:56:23,523 INFO L276 IsEmpty]: Start isEmpty. Operand 260 states and 260 transitions. [2019-08-05 10:56:23,524 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 260 [2019-08-05 10:56:23,524 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:23,524 INFO L399 BasicCegarLoop]: trace histogram [256, 1, 1, 1] [2019-08-05 10:56:23,525 INFO L418 AbstractCegarLoop]: === Iteration 30 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:23,525 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:23,525 INFO L82 PathProgramCache]: Analyzing trace with hash -1837449120, now seen corresponding path program 29 times [2019-08-05 10:56:23,526 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:23,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:23,749 WARN L254 TraceCheckSpWp]: Trace formula consists of 2317 conjuncts, 1930 conjunts are in the unsatisfiable core [2019-08-05 10:56:23,900 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:24,246 WARN L188 SmtUtils]: Spent 148.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:56:33,700 INFO L134 CoverageAnalysis]: Checked inductivity of 32896 backedges. 1 proven. 32768 refuted. 0 times theorem prover too weak. 127 trivial. 0 not checked. [2019-08-05 10:56:33,701 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:33,701 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [131] total 131 [2019-08-05 10:56:33,702 INFO L454 AbstractCegarLoop]: Interpolant automaton has 133 states [2019-08-05 10:56:33,702 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 133 interpolants. [2019-08-05 10:56:33,703 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=266, Invalid=17290, Unknown=0, NotChecked=0, Total=17556 [2019-08-05 10:56:33,703 INFO L87 Difference]: Start difference. First operand 260 states and 260 transitions. Second operand 133 states. [2019-08-05 10:56:46,114 WARN L188 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 22 DAG size of output: 18 [2019-08-05 10:56:46,115 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:46,115 INFO L93 Difference]: Finished difference Result 259 states and 259 transitions. [2019-08-05 10:56:46,115 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 132 states. [2019-08-05 10:56:46,116 INFO L78 Accepts]: Start accepts. Automaton has 133 states. Word has length 259 [2019-08-05 10:56:46,116 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:46,117 INFO L225 Difference]: With dead ends: 259 [2019-08-05 10:56:46,117 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 10:56:46,117 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 260 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 133 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 9.5s TimeCoverageRelationStatistics Valid=276, Invalid=17814, Unknown=0, NotChecked=0, Total=18090 [2019-08-05 10:56:46,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 10:56:46,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 10:56:46,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 10:56:46,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 10:56:46,118 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 259 [2019-08-05 10:56:46,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:46,118 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 10:56:46,119 INFO L476 AbstractCegarLoop]: Interpolant automaton has 133 states. [2019-08-05 10:56:46,119 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 10:56:46,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 10:56:46,123 INFO L202 PluginConnector]: Adding new model CounterExp-8bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:56:46 BoogieIcfgContainer [2019-08-05 10:56:46,123 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:56:46,125 INFO L168 Benchmark]: Toolchain (without parser) took 208230.36 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 107.9 MB in the beginning and 409.6 MB in the end (delta: -301.7 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:46,126 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.21 ms. Allocated memory is still 138.4 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:56:46,126 INFO L168 Benchmark]: Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 138.4 MB. Free memory was 107.5 MB in the beginning and 105.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:46,127 INFO L168 Benchmark]: Boogie Preprocessor took 31.32 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:46,128 INFO L168 Benchmark]: RCFGBuilder took 951.47 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 72.2 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. [2019-08-05 10:56:46,129 INFO L168 Benchmark]: TraceAbstraction took 207202.43 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 72.2 MB in the beginning and 409.6 MB in the end (delta: -337.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-08-05 10:56:46,132 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.21 ms. Allocated memory is still 138.4 MB. Free memory is still 108.8 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 38.84 ms. Allocated memory is still 138.4 MB. Free memory was 107.5 MB in the beginning and 105.8 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 31.32 ms. Allocated memory is still 138.4 MB. Free memory was 105.8 MB in the beginning and 104.5 MB in the end (delta: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 7.1 GB. * RCFGBuilder took 951.47 ms. Allocated memory is still 138.4 MB. Free memory was 104.5 MB in the beginning and 72.2 MB in the end (delta: 32.3 MB). Peak memory consumption was 32.3 MB. Max. memory is 7.1 GB. * TraceAbstraction took 207202.43 ms. Allocated memory was 138.4 MB in the beginning and 1.6 GB in the end (delta: 1.4 GB). Free memory was 72.2 MB in the beginning and 409.6 MB in the end (delta: -337.4 MB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 86]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. SAFE Result, 207.1s OverallTime, 30 OverallIterations, 256 TraceHistogramMax, 109.8s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 82 SDtfs, 15 SDslu, 280 SDs, 0 SdLazy, 137251 SolverSat, 1364 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 80.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2339 GetRequests, 555 SyntacticMatches, 0 SemanticMatches, 1784 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10555 ImplicationChecksByTransitivity, 101.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=260occurred in iteration=29, 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, 30 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.5s SatisfiabilityAnalysisTime, 95.0s InterpolantComputationTime, 2109 NumberOfCodeBlocks, 2109 NumberOfCodeBlocksAsserted, 30 NumberOfCheckSat, 2079 ConstructedInterpolants, 0 QuantifiedInterpolants, 3305368 SizeOfPredicates, 223 NumberOfNonLiveVariables, 18561 ConjunctsInSsa, 15422 ConjunctsInUnsatCore, 30 InterpolantComputations, 1 PerfectInterpolantSequences, 1086/132665 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...