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-16bit.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 10:53:18,681 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 10:53:18,683 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 10:53:18,703 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 10:53:18,704 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 10:53:18,705 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 10:53:18,706 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 10:53:18,708 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 10:53:18,710 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 10:53:18,711 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 10:53:18,712 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 10:53:18,712 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 10:53:18,713 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 10:53:18,714 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 10:53:18,715 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 10:53:18,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 10:53:18,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 10:53:18,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 10:53:18,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 10:53:18,722 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 10:53:18,724 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 10:53:18,725 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 10:53:18,726 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 10:53:18,727 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 10:53:18,729 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 10:53:18,730 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 10:53:18,730 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 10:53:18,731 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 10:53:18,731 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 10:53:18,732 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 10:53:18,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 10:53:18,733 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 10:53:18,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 10:53:18,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 10:53:18,736 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 10:53:18,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 10:53:18,737 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 10:53:18,737 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 10:53:18,738 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 10:53:18,739 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 10:53:18,739 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 10:53:18,780 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 10:53:18,796 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 10:53:18,800 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 10:53:18,802 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 10:53:18,802 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 10:53:18,804 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-16bit.bpl [2019-08-05 10:53:18,804 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/programs/scalable/CounterExp-16bit.bpl' [2019-08-05 10:53:18,855 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 10:53:18,856 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 10:53:18,857 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:18,857 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 10:53:18,857 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 10:53:18,872 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,883 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,888 WARN L165 Inliner]: Program contained no entry procedure! [2019-08-05 10:53:18,888 WARN L168 Inliner]: Missing entry procedures: [ULTIMATE.start] [2019-08-05 10:53:18,889 WARN L175 Inliner]: Fallback enabled. All procedures will be processed. [2019-08-05 10:53:18,891 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 10:53:18,891 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 10:53:18,892 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 10:53:18,892 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 10:53:18,902 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,903 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,904 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,909 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,916 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,918 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/1) ... [2019-08-05 10:53:18,920 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 10:53:18,921 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 10:53:18,921 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 10:53:18,921 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 10:53:18,922 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (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,981 INFO L124 BoogieDeclarations]: Specification and implementation of procedure ThreeBitCounter given in one single declaration [2019-08-05 10:53:18,982 INFO L130 BoogieDeclarations]: Found specification of procedure ThreeBitCounter [2019-08-05 10:53:18,982 INFO L138 BoogieDeclarations]: Found implementation of procedure ThreeBitCounter [2019-08-05 10:53:20,696 INFO L275 CfgBuilder]: Using library mode [2019-08-05 10:53:20,697 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 10:53:20,698 INFO L202 PluginConnector]: Adding new model CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:20 BoogieIcfgContainer [2019-08-05 10:53:20,698 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 10:53:20,700 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 10:53:20,700 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 10:53:20,707 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 10:53:20,708 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 10:53:18" (1/2) ... [2019-08-05 10:53:20,709 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3c2be44d and model type CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 10:53:20, skipping insertion in model container [2019-08-05 10:53:20,709 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 10:53:20" (2/2) ... [2019-08-05 10:53:20,711 INFO L109 eAbstractionObserver]: Analyzing ICFG CounterExp-16bit.bpl [2019-08-05 10:53:20,720 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 10:53:20,735 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 10:53:20,752 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 10:53:20,783 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 10:53:20,784 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 10:53:20,784 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 10:53:20,784 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 10:53:20,784 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 10:53:20,785 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 10:53:20,785 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 10:53:20,785 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 10:53:20,787 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 10:53:20,798 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states. [2019-08-05 10:53:20,805 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-08-05 10:53:20,805 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:20,806 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-08-05 10:53:20,809 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:20,814 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:20,814 INFO L82 PathProgramCache]: Analyzing trace with hash 35936, now seen corresponding path program 1 times [2019-08-05 10:53:20,858 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:20,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:20,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 10:53:20,884 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:20,949 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:20,951 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 10:53:20,951 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-08-05 10:53:20,955 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 10:53:20,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 10:53:20,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 10:53:20,968 INFO L87 Difference]: Start difference. First operand 5 states. Second operand 3 states. [2019-08-05 10:53:21,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:21,026 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:21,027 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 10:53:21,028 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-08-05 10:53:21,029 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:21,039 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:21,039 INFO L226 Difference]: Without dead ends: 5 [2019-08-05 10:53:21,041 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:21,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5 states. [2019-08-05 10:53:21,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5 to 5. [2019-08-05 10:53:21,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-08-05 10:53:21,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 5 transitions. [2019-08-05 10:53:21,074 INFO L78 Accepts]: Start accepts. Automaton has 5 states and 5 transitions. Word has length 3 [2019-08-05 10:53:21,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:21,076 INFO L475 AbstractCegarLoop]: Abstraction has 5 states and 5 transitions. [2019-08-05 10:53:21,076 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 10:53:21,076 INFO L276 IsEmpty]: Start isEmpty. Operand 5 states and 5 transitions. [2019-08-05 10:53:21,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2019-08-05 10:53:21,076 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:21,076 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2019-08-05 10:53:21,077 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:21,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:21,077 INFO L82 PathProgramCache]: Analyzing trace with hash 1177604, now seen corresponding path program 1 times [2019-08-05 10:53:21,078 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:21,104 INFO L256 TraceCheckSpWp]: Trace formula consists of 38 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 10:53:21,105 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:21,222 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:21,223 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:21,223 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3] total 3 [2019-08-05 10:53:21,224 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 10:53:21,225 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 10:53:21,225 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-08-05 10:53:21,225 INFO L87 Difference]: Start difference. First operand 5 states and 5 transitions. Second operand 4 states. [2019-08-05 10:53:21,306 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:21,306 INFO L93 Difference]: Finished difference Result 6 states and 6 transitions. [2019-08-05 10:53:21,307 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 10:53:21,307 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 4 [2019-08-05 10:53:21,307 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:21,308 INFO L225 Difference]: With dead ends: 6 [2019-08-05 10:53:21,308 INFO L226 Difference]: Without dead ends: 6 [2019-08-05 10:53:21,309 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:21,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6 states. [2019-08-05 10:53:21,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6 to 6. [2019-08-05 10:53:21,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2019-08-05 10:53:21,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 6 transitions. [2019-08-05 10:53:21,311 INFO L78 Accepts]: Start accepts. Automaton has 6 states and 6 transitions. Word has length 4 [2019-08-05 10:53:21,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:21,312 INFO L475 AbstractCegarLoop]: Abstraction has 6 states and 6 transitions. [2019-08-05 10:53:21,312 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 10:53:21,312 INFO L276 IsEmpty]: Start isEmpty. Operand 6 states and 6 transitions. [2019-08-05 10:53:21,312 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-08-05 10:53:21,312 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:21,313 INFO L399 BasicCegarLoop]: trace histogram [2, 1, 1, 1] [2019-08-05 10:53:21,313 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:21,313 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:21,314 INFO L82 PathProgramCache]: Analyzing trace with hash 36569312, now seen corresponding path program 2 times [2019-08-05 10:53:21,315 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:21,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:21,357 INFO L256 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 21 conjunts are in the unsatisfiable core [2019-08-05 10:53:21,365 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:21,644 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:21,645 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:21,645 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:21,645 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:21,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:21,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:21,647 INFO L87 Difference]: Start difference. First operand 6 states and 6 transitions. Second operand 5 states. [2019-08-05 10:53:21,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:21,856 INFO L93 Difference]: Finished difference Result 7 states and 7 transitions. [2019-08-05 10:53:21,857 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:21,857 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 5 [2019-08-05 10:53:21,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:21,857 INFO L225 Difference]: With dead ends: 7 [2019-08-05 10:53:21,857 INFO L226 Difference]: Without dead ends: 7 [2019-08-05 10:53:21,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:21,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7 states. [2019-08-05 10:53:21,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7 to 7. [2019-08-05 10:53:21,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-08-05 10:53:21,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 7 transitions. [2019-08-05 10:53:21,861 INFO L78 Accepts]: Start accepts. Automaton has 7 states and 7 transitions. Word has length 5 [2019-08-05 10:53:21,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:21,861 INFO L475 AbstractCegarLoop]: Abstraction has 7 states and 7 transitions. [2019-08-05 10:53:21,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:21,861 INFO L276 IsEmpty]: Start isEmpty. Operand 7 states and 7 transitions. [2019-08-05 10:53:21,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2019-08-05 10:53:21,861 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:21,862 INFO L399 BasicCegarLoop]: trace histogram [3, 1, 1, 1] [2019-08-05 10:53:21,862 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:21,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:21,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1133712260, now seen corresponding path program 3 times [2019-08-05 10:53:21,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:21,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:21,897 WARN L254 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 38 conjunts are in the unsatisfiable core [2019-08-05 10:53:21,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:22,038 WARN L188 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:53:22,347 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: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 [5] total 5 [2019-08-05 10:53:22,349 INFO L454 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-08-05 10:53:22,349 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-08-05 10:53:22,349 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-08-05 10:53:22,350 INFO L87 Difference]: Start difference. First operand 7 states and 7 transitions. Second operand 6 states. [2019-08-05 10:53:22,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:22,444 INFO L93 Difference]: Finished difference Result 8 states and 8 transitions. [2019-08-05 10:53:22,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-08-05 10:53:22,445 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 6 [2019-08-05 10:53:22,445 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:22,446 INFO L225 Difference]: With dead ends: 8 [2019-08-05 10:53:22,446 INFO L226 Difference]: Without dead ends: 8 [2019-08-05 10:53:22,447 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:22,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8 states. [2019-08-05 10:53:22,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8 to 8. [2019-08-05 10:53:22,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-08-05 10:53:22,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 8 transitions. [2019-08-05 10:53:22,450 INFO L78 Accepts]: Start accepts. Automaton has 8 states and 8 transitions. Word has length 6 [2019-08-05 10:53:22,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:22,450 INFO L475 AbstractCegarLoop]: Abstraction has 8 states and 8 transitions. [2019-08-05 10:53:22,450 INFO L476 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-08-05 10:53:22,450 INFO L276 IsEmpty]: Start isEmpty. Operand 8 states and 8 transitions. [2019-08-05 10:53:22,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2019-08-05 10:53:22,451 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:22,451 INFO L399 BasicCegarLoop]: trace histogram [4, 1, 1, 1] [2019-08-05 10:53:22,452 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:22,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:22,452 INFO L82 PathProgramCache]: Analyzing trace with hash 785405280, now seen corresponding path program 4 times [2019-08-05 10:53:22,453 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:22,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:22,487 INFO L256 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 31 conjunts are in the unsatisfiable core [2019-08-05 10:53:22,498 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:22,787 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:22,788 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:22,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6] total 6 [2019-08-05 10:53:22,788 INFO L454 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-08-05 10:53:22,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-08-05 10:53:22,790 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:22,790 INFO L87 Difference]: Start difference. First operand 8 states and 8 transitions. Second operand 7 states. [2019-08-05 10:53:22,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:22,969 INFO L93 Difference]: Finished difference Result 9 states and 9 transitions. [2019-08-05 10:53:22,969 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:22,970 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 7 [2019-08-05 10:53:22,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:22,970 INFO L225 Difference]: With dead ends: 9 [2019-08-05 10:53:22,970 INFO L226 Difference]: Without dead ends: 9 [2019-08-05 10:53:22,971 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-08-05 10:53:22,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9 states. [2019-08-05 10:53:22,972 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9 to 9. [2019-08-05 10:53:22,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2019-08-05 10:53:22,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 9 transitions. [2019-08-05 10:53:22,973 INFO L78 Accepts]: Start accepts. Automaton has 9 states and 9 transitions. Word has length 7 [2019-08-05 10:53:22,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:22,974 INFO L475 AbstractCegarLoop]: Abstraction has 9 states and 9 transitions. [2019-08-05 10:53:22,974 INFO L476 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-08-05 10:53:22,974 INFO L276 IsEmpty]: Start isEmpty. Operand 9 states and 9 transitions. [2019-08-05 10:53:22,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2019-08-05 10:53:22,974 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:22,975 INFO L399 BasicCegarLoop]: trace histogram [5, 1, 1, 1] [2019-08-05 10:53:22,975 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:22,975 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:22,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1422176508, now seen corresponding path program 5 times [2019-08-05 10:53:22,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:23,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:23,004 INFO L256 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 23 conjunts are in the unsatisfiable core [2019-08-05 10:53:23,015 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:23,084 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:23,084 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:23,084 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 10:53:23,085 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 10:53:23,085 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 10:53:23,085 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-08-05 10:53:23,085 INFO L87 Difference]: Start difference. First operand 9 states and 9 transitions. Second operand 5 states. [2019-08-05 10:53:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:23,134 INFO L93 Difference]: Finished difference Result 10 states and 10 transitions. [2019-08-05 10:53:23,134 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 10:53:23,134 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 8 [2019-08-05 10:53:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:23,135 INFO L225 Difference]: With dead ends: 10 [2019-08-05 10:53:23,135 INFO L226 Difference]: Without dead ends: 10 [2019-08-05 10:53:23,135 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-08-05 10:53:23,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10 states. [2019-08-05 10:53:23,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10 to 10. [2019-08-05 10:53:23,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2019-08-05 10:53:23,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 10 transitions. [2019-08-05 10:53:23,138 INFO L78 Accepts]: Start accepts. Automaton has 10 states and 10 transitions. Word has length 8 [2019-08-05 10:53:23,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:23,139 INFO L475 AbstractCegarLoop]: Abstraction has 10 states and 10 transitions. [2019-08-05 10:53:23,139 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 10:53:23,139 INFO L276 IsEmpty]: Start isEmpty. Operand 10 states and 10 transitions. [2019-08-05 10:53:23,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-08-05 10:53:23,139 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:23,139 INFO L399 BasicCegarLoop]: trace histogram [6, 1, 1, 1] [2019-08-05 10:53:23,140 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:23,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:23,140 INFO L82 PathProgramCache]: Analyzing trace with hash -1137735200, now seen corresponding path program 6 times [2019-08-05 10:53:23,141 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:23,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:23,170 INFO L256 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 32 conjunts are in the unsatisfiable core [2019-08-05 10:53:23,182 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:23,386 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-08-05 10:53:23,387 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:23,387 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 10:53:23,387 INFO L454 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-08-05 10:53:23,388 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-08-05 10:53:23,388 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-08-05 10:53:23,389 INFO L87 Difference]: Start difference. First operand 10 states and 10 transitions. Second operand 8 states. [2019-08-05 10:53:23,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:23,508 INFO L93 Difference]: Finished difference Result 12 states and 12 transitions. [2019-08-05 10:53:23,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-08-05 10:53:23,509 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 9 [2019-08-05 10:53:23,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:23,510 INFO L225 Difference]: With dead ends: 12 [2019-08-05 10:53:23,510 INFO L226 Difference]: Without dead ends: 12 [2019-08-05 10:53:23,511 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:23,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12 states. [2019-08-05 10:53:23,512 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12 to 12. [2019-08-05 10:53:23,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2019-08-05 10:53:23,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 12 transitions. [2019-08-05 10:53:23,513 INFO L78 Accepts]: Start accepts. Automaton has 12 states and 12 transitions. Word has length 9 [2019-08-05 10:53:23,513 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:23,513 INFO L475 AbstractCegarLoop]: Abstraction has 12 states and 12 transitions. [2019-08-05 10:53:23,513 INFO L476 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-08-05 10:53:23,513 INFO L276 IsEmpty]: Start isEmpty. Operand 12 states and 12 transitions. [2019-08-05 10:53:23,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-08-05 10:53:23,514 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:23,514 INFO L399 BasicCegarLoop]: trace histogram [8, 1, 1, 1] [2019-08-05 10:53:23,514 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:23,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:23,515 INFO L82 PathProgramCache]: Analyzing trace with hash 1855168096, now seen corresponding path program 7 times [2019-08-05 10:53:23,515 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:23,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:23,548 WARN L254 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 138 conjunts are in the unsatisfiable core [2019-08-05 10:53:23,573 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:24,479 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:24,480 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:24,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10] total 10 [2019-08-05 10:53:24,481 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 10:53:24,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 10:53:24,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:24,482 INFO L87 Difference]: Start difference. First operand 12 states and 12 transitions. Second operand 11 states. [2019-08-05 10:53:24,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:24,643 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2019-08-05 10:53:24,644 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:24,644 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 11 [2019-08-05 10:53:24,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:24,645 INFO L225 Difference]: With dead ends: 16 [2019-08-05 10:53:24,645 INFO L226 Difference]: Without dead ends: 16 [2019-08-05 10:53:24,646 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=27, Invalid=83, Unknown=0, NotChecked=0, Total=110 [2019-08-05 10:53:24,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2019-08-05 10:53:24,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2019-08-05 10:53:24,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2019-08-05 10:53:24,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2019-08-05 10:53:24,649 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 11 [2019-08-05 10:53:24,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:24,649 INFO L475 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2019-08-05 10:53:24,649 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 10:53:24,649 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2019-08-05 10:53:24,650 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-08-05 10:53:24,650 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:24,650 INFO L399 BasicCegarLoop]: trace histogram [12, 1, 1, 1] [2019-08-05 10:53:24,650 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:24,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:24,650 INFO L82 PathProgramCache]: Analyzing trace with hash 428500832, now seen corresponding path program 8 times [2019-08-05 10:53:24,651 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:24,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:24,694 INFO L256 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2019-08-05 10:53:24,707 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:24,826 WARN L188 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 9 [2019-08-05 10:53:25,272 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:25,273 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:25,273 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 10:53:25,273 INFO L454 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-08-05 10:53:25,273 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-08-05 10:53:25,274 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2019-08-05 10:53:25,274 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 12 states. [2019-08-05 10:53:26,416 WARN L188 SmtUtils]: Spent 115.00 ms on a formula simplification that was a NOOP. DAG size: 7 [2019-08-05 10:53:26,760 WARN L188 SmtUtils]: Spent 110.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-08-05 10:53:26,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:26,856 INFO L93 Difference]: Finished difference Result 20 states and 20 transitions. [2019-08-05 10:53:26,856 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-08-05 10:53:26,856 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 15 [2019-08-05 10:53:26,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:26,857 INFO L225 Difference]: With dead ends: 20 [2019-08-05 10:53:26,857 INFO L226 Difference]: Without dead ends: 20 [2019-08-05 10:53:26,858 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:26,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-08-05 10:53:26,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-08-05 10:53:26,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-08-05 10:53:26,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 20 transitions. [2019-08-05 10:53:26,861 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 20 transitions. Word has length 15 [2019-08-05 10:53:26,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:26,861 INFO L475 AbstractCegarLoop]: Abstraction has 20 states and 20 transitions. [2019-08-05 10:53:26,861 INFO L476 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-08-05 10:53:26,862 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 20 transitions. [2019-08-05 10:53:26,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-08-05 10:53:26,862 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:26,862 INFO L399 BasicCegarLoop]: trace histogram [16, 1, 1, 1] [2019-08-05 10:53:26,863 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:26,863 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:26,863 INFO L82 PathProgramCache]: Analyzing trace with hash 1777643616, now seen corresponding path program 9 times [2019-08-05 10:53:26,864 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:26,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:26,916 WARN L254 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 271 conjunts are in the unsatisfiable core [2019-08-05 10:53:26,938 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:27,289 WARN L188 SmtUtils]: Spent 165.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:53:27,600 WARN L188 SmtUtils]: Spent 198.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:27,934 WARN L188 SmtUtils]: Spent 197.00 ms on a formula simplification that was a NOOP. DAG size: 14 [2019-08-05 10:53:28,286 WARN L188 SmtUtils]: Spent 191.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:28,649 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:29,066 WARN L188 SmtUtils]: Spent 206.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:53:29,910 WARN L188 SmtUtils]: Spent 187.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:53:30,420 WARN L188 SmtUtils]: Spent 185.00 ms on a formula simplification that was a NOOP. DAG size: 13 [2019-08-05 10:53:30,965 WARN L188 SmtUtils]: Spent 186.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:53:31,509 WARN L188 SmtUtils]: Spent 182.00 ms on a formula simplification that was a NOOP. DAG size: 12 [2019-08-05 10:53:32,069 WARN L188 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2019-08-05 10:53:32,501 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:32,502 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:32,502 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18] total 18 [2019-08-05 10:53:32,503 INFO L454 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-08-05 10:53:32,504 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-08-05 10:53:32,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:32,505 INFO L87 Difference]: Start difference. First operand 20 states and 20 transitions. Second operand 19 states. [2019-08-05 10:53:33,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:33,833 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2019-08-05 10:53:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:53:33,833 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 19 [2019-08-05 10:53:33,834 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:33,834 INFO L225 Difference]: With dead ends: 28 [2019-08-05 10:53:33,835 INFO L226 Difference]: Without dead ends: 28 [2019-08-05 10:53:33,835 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-08-05 10:53:33,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-08-05 10:53:33,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2019-08-05 10:53:33,839 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2019-08-05 10:53:33,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 28 transitions. [2019-08-05 10:53:33,839 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 28 transitions. Word has length 19 [2019-08-05 10:53:33,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:33,840 INFO L475 AbstractCegarLoop]: Abstraction has 28 states and 28 transitions. [2019-08-05 10:53:33,840 INFO L476 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-08-05 10:53:33,840 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 28 transitions. [2019-08-05 10:53:33,841 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-08-05 10:53:33,841 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:33,841 INFO L399 BasicCegarLoop]: trace histogram [24, 1, 1, 1] [2019-08-05 10:53:33,841 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:33,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:33,841 INFO L82 PathProgramCache]: Analyzing trace with hash 1143194208, now seen corresponding path program 10 times [2019-08-05 10:53:33,842 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:33,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:33,916 INFO L256 TraceCheckSpWp]: Trace formula consists of 429 conjuncts, 125 conjunts are in the unsatisfiable core [2019-08-05 10:53:33,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:34,728 INFO L134 CoverageAnalysis]: Checked inductivity of 300 backedges. 0 proven. 293 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2019-08-05 10:53:34,729 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:34,729 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19] total 19 [2019-08-05 10:53:34,729 INFO L454 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-08-05 10:53:34,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-08-05 10:53:34,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=341, Unknown=0, NotChecked=0, Total=380 [2019-08-05 10:53:34,731 INFO L87 Difference]: Start difference. First operand 28 states and 28 transitions. Second operand 20 states. [2019-08-05 10:53:35,483 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:53:36,041 WARN L188 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 10 [2019-08-05 10:53:36,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:36,877 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2019-08-05 10:53:36,878 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-08-05 10:53:36,878 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 27 [2019-08-05 10:53:36,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:36,879 INFO L225 Difference]: With dead ends: 36 [2019-08-05 10:53:36,879 INFO L226 Difference]: Without dead ends: 36 [2019-08-05 10:53:36,880 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 105 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:53:36,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2019-08-05 10:53:36,883 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2019-08-05 10:53:36,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2019-08-05 10:53:36,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2019-08-05 10:53:36,884 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 27 [2019-08-05 10:53:36,885 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:36,885 INFO L475 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2019-08-05 10:53:36,885 INFO L476 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-08-05 10:53:36,885 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2019-08-05 10:53:36,886 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-08-05 10:53:36,886 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:36,886 INFO L399 BasicCegarLoop]: trace histogram [32, 1, 1, 1] [2019-08-05 10:53:36,886 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:36,886 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:36,887 INFO L82 PathProgramCache]: Analyzing trace with hash 1327551584, now seen corresponding path program 11 times [2019-08-05 10:53:36,887 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:36,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:36,981 WARN L254 TraceCheckSpWp]: Trace formula consists of 565 conjuncts, 536 conjunts are in the unsatisfiable core [2019-08-05 10:53:37,021 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:37,172 WARN L188 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:53:38,848 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:38,848 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:38,848 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [34] total 34 [2019-08-05 10:53:38,849 INFO L454 AbstractCegarLoop]: Interpolant automaton has 35 states [2019-08-05 10:53:38,849 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2019-08-05 10:53:38,850 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:53:38,850 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 35 states. [2019-08-05 10:53:39,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:39,986 INFO L93 Difference]: Finished difference Result 52 states and 52 transitions. [2019-08-05 10:53:39,986 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2019-08-05 10:53:39,987 INFO L78 Accepts]: Start accepts. Automaton has 35 states. Word has length 35 [2019-08-05 10:53:39,987 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:39,988 INFO L225 Difference]: With dead ends: 52 [2019-08-05 10:53:39,989 INFO L226 Difference]: Without dead ends: 52 [2019-08-05 10:53:39,990 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=99, Invalid=1091, Unknown=0, NotChecked=0, Total=1190 [2019-08-05 10:53:39,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2019-08-05 10:53:39,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2019-08-05 10:53:39,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 52 states. [2019-08-05 10:53:39,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 52 transitions. [2019-08-05 10:53:39,995 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 52 transitions. Word has length 35 [2019-08-05 10:53:39,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:39,995 INFO L475 AbstractCegarLoop]: Abstraction has 52 states and 52 transitions. [2019-08-05 10:53:39,995 INFO L476 AbstractCegarLoop]: Interpolant automaton has 35 states. [2019-08-05 10:53:39,995 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 52 transitions. [2019-08-05 10:53:39,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-08-05 10:53:39,997 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:39,997 INFO L399 BasicCegarLoop]: trace histogram [48, 1, 1, 1] [2019-08-05 10:53:39,997 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:39,997 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:39,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1065678944, now seen corresponding path program 12 times [2019-08-05 10:53:39,998 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:40,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:40,130 WARN L254 TraceCheckSpWp]: Trace formula consists of 837 conjuncts, 800 conjunts are in the unsatisfiable core [2019-08-05 10:53:40,187 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:42,482 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:42,482 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:42,483 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [50] total 50 [2019-08-05 10:53:42,483 INFO L454 AbstractCegarLoop]: Interpolant automaton has 51 states [2019-08-05 10:53:42,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2019-08-05 10:53:42,485 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:53:42,485 INFO L87 Difference]: Start difference. First operand 52 states and 52 transitions. Second operand 51 states. [2019-08-05 10:53:44,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:44,536 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2019-08-05 10:53:44,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 51 states. [2019-08-05 10:53:44,537 INFO L78 Accepts]: Start accepts. Automaton has 51 states. Word has length 51 [2019-08-05 10:53:44,538 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:44,539 INFO L225 Difference]: With dead ends: 68 [2019-08-05 10:53:44,539 INFO L226 Difference]: Without dead ends: 68 [2019-08-05 10:53:44,541 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=147, Invalid=2403, Unknown=0, NotChecked=0, Total=2550 [2019-08-05 10:53:44,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2019-08-05 10:53:44,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2019-08-05 10:53:44,546 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 68 states. [2019-08-05 10:53:44,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 68 transitions. [2019-08-05 10:53:44,547 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 68 transitions. Word has length 51 [2019-08-05 10:53:44,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:44,548 INFO L475 AbstractCegarLoop]: Abstraction has 68 states and 68 transitions. [2019-08-05 10:53:44,548 INFO L476 AbstractCegarLoop]: Interpolant automaton has 51 states. [2019-08-05 10:53:44,548 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 68 transitions. [2019-08-05 10:53:44,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-08-05 10:53:44,549 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:44,549 INFO L399 BasicCegarLoop]: trace histogram [64, 1, 1, 1] [2019-08-05 10:53:44,550 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:44,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:44,550 INFO L82 PathProgramCache]: Analyzing trace with hash -887022496, now seen corresponding path program 13 times [2019-08-05 10:53:44,551 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:44,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:44,787 WARN L254 TraceCheckSpWp]: Trace formula consists of 1109 conjuncts, 1065 conjunts are in the unsatisfiable core [2019-08-05 10:53:44,861 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:49,292 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:49,293 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:49,293 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [66] total 66 [2019-08-05 10:53:49,293 INFO L454 AbstractCegarLoop]: Interpolant automaton has 67 states [2019-08-05 10:53:49,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 67 interpolants. [2019-08-05 10:53:49,295 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:53:49,295 INFO L87 Difference]: Start difference. First operand 68 states and 68 transitions. Second operand 67 states. [2019-08-05 10:53:52,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:53:52,909 INFO L93 Difference]: Finished difference Result 84 states and 84 transitions. [2019-08-05 10:53:52,909 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 67 states. [2019-08-05 10:53:52,909 INFO L78 Accepts]: Start accepts. Automaton has 67 states. Word has length 67 [2019-08-05 10:53:52,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:53:52,911 INFO L225 Difference]: With dead ends: 84 [2019-08-05 10:53:52,911 INFO L226 Difference]: Without dead ends: 84 [2019-08-05 10:53:52,914 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 4.0s TimeCoverageRelationStatistics Valid=195, Invalid=4227, Unknown=0, NotChecked=0, Total=4422 [2019-08-05 10:53:52,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2019-08-05 10:53:52,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2019-08-05 10:53:52,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2019-08-05 10:53:52,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2019-08-05 10:53:52,920 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 67 [2019-08-05 10:53:52,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:53:52,921 INFO L475 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2019-08-05 10:53:52,921 INFO L476 AbstractCegarLoop]: Interpolant automaton has 67 states. [2019-08-05 10:53:52,921 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2019-08-05 10:53:52,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2019-08-05 10:53:52,922 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:53:52,922 INFO L399 BasicCegarLoop]: trace histogram [80, 1, 1, 1] [2019-08-05 10:53:52,923 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:53:52,923 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:53:52,923 INFO L82 PathProgramCache]: Analyzing trace with hash -2114633632, now seen corresponding path program 14 times [2019-08-05 10:53:52,924 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:53:53,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:53:53,092 WARN L254 TraceCheckSpWp]: Trace formula consists of 1381 conjuncts, 1329 conjunts are in the unsatisfiable core [2019-08-05 10:53:53,218 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:53:54,167 WARN L188 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:53:58,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3240 backedges. 0 proven. 3240 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:53:58,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:53:58,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [82] total 82 [2019-08-05 10:53:58,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 83 states [2019-08-05 10:53:58,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 83 interpolants. [2019-08-05 10:53:58,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:53:58,961 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 83 states. [2019-08-05 10:54:03,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:03,836 INFO L93 Difference]: Finished difference Result 100 states and 100 transitions. [2019-08-05 10:54:03,836 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 83 states. [2019-08-05 10:54:03,836 INFO L78 Accepts]: Start accepts. Automaton has 83 states. Word has length 83 [2019-08-05 10:54:03,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:03,838 INFO L225 Difference]: With dead ends: 100 [2019-08-05 10:54:03,838 INFO L226 Difference]: Without dead ends: 100 [2019-08-05 10:54:03,842 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 5.1s TimeCoverageRelationStatistics Valid=243, Invalid=6563, Unknown=0, NotChecked=0, Total=6806 [2019-08-05 10:54:03,842 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2019-08-05 10:54:03,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2019-08-05 10:54:03,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 100 states. [2019-08-05 10:54:03,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 100 transitions. [2019-08-05 10:54:03,848 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 100 transitions. Word has length 83 [2019-08-05 10:54:03,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:03,849 INFO L475 AbstractCegarLoop]: Abstraction has 100 states and 100 transitions. [2019-08-05 10:54:03,849 INFO L476 AbstractCegarLoop]: Interpolant automaton has 83 states. [2019-08-05 10:54:03,849 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 100 transitions. [2019-08-05 10:54:03,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2019-08-05 10:54:03,850 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:03,850 INFO L399 BasicCegarLoop]: trace histogram [96, 1, 1, 1] [2019-08-05 10:54:03,851 INFO L418 AbstractCegarLoop]: === Iteration 16 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:03,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:03,851 INFO L82 PathProgramCache]: Analyzing trace with hash -201235360, now seen corresponding path program 15 times [2019-08-05 10:54:03,852 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:04,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:04,050 WARN L254 TraceCheckSpWp]: Trace formula consists of 1653 conjuncts, 1593 conjunts are in the unsatisfiable core [2019-08-05 10:54:04,153 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:05,665 WARN L188 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 17 [2019-08-05 10:54:10,957 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:10,957 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:10,957 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [98] total 98 [2019-08-05 10:54:10,958 INFO L454 AbstractCegarLoop]: Interpolant automaton has 99 states [2019-08-05 10:54:10,958 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 99 interpolants. [2019-08-05 10:54:10,960 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:10,960 INFO L87 Difference]: Start difference. First operand 100 states and 100 transitions. Second operand 99 states. [2019-08-05 10:54:17,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:17,929 INFO L93 Difference]: Finished difference Result 116 states and 116 transitions. [2019-08-05 10:54:17,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 99 states. [2019-08-05 10:54:17,929 INFO L78 Accepts]: Start accepts. Automaton has 99 states. Word has length 99 [2019-08-05 10:54:17,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:17,931 INFO L225 Difference]: With dead ends: 116 [2019-08-05 10:54:17,931 INFO L226 Difference]: Without dead ends: 116 [2019-08-05 10:54:17,934 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=291, Invalid=9411, Unknown=0, NotChecked=0, Total=9702 [2019-08-05 10:54:17,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2019-08-05 10:54:17,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2019-08-05 10:54:17,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 116 states. [2019-08-05 10:54:17,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 116 transitions. [2019-08-05 10:54:17,941 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 116 transitions. Word has length 99 [2019-08-05 10:54:17,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:17,942 INFO L475 AbstractCegarLoop]: Abstraction has 116 states and 116 transitions. [2019-08-05 10:54:17,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 99 states. [2019-08-05 10:54:17,942 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 116 transitions. [2019-08-05 10:54:17,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2019-08-05 10:54:17,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:17,944 INFO L399 BasicCegarLoop]: trace histogram [112, 1, 1, 1] [2019-08-05 10:54:17,944 INFO L418 AbstractCegarLoop]: === Iteration 17 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:17,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:17,945 INFO L82 PathProgramCache]: Analyzing trace with hash -1320843168, now seen corresponding path program 16 times [2019-08-05 10:54:17,946 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:18,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:18,171 WARN L254 TraceCheckSpWp]: Trace formula consists of 1925 conjuncts, 1857 conjunts are in the unsatisfiable core [2019-08-05 10:54:18,313 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:27,039 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:27,040 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:27,040 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [114] total 114 [2019-08-05 10:54:27,040 INFO L454 AbstractCegarLoop]: Interpolant automaton has 115 states [2019-08-05 10:54:27,040 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 115 interpolants. [2019-08-05 10:54:27,043 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:27,044 INFO L87 Difference]: Start difference. First operand 116 states and 116 transitions. Second operand 115 states. [2019-08-05 10:54:36,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:36,546 INFO L93 Difference]: Finished difference Result 132 states and 132 transitions. [2019-08-05 10:54:36,546 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 115 states. [2019-08-05 10:54:36,546 INFO L78 Accepts]: Start accepts. Automaton has 115 states. Word has length 115 [2019-08-05 10:54:36,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:36,548 INFO L225 Difference]: With dead ends: 132 [2019-08-05 10:54:36,548 INFO L226 Difference]: Without dead ends: 132 [2019-08-05 10:54:36,550 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 113 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=339, Invalid=12771, Unknown=0, NotChecked=0, Total=13110 [2019-08-05 10:54:36,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2019-08-05 10:54:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2019-08-05 10:54:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 10:54:36,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 132 transitions. [2019-08-05 10:54:36,556 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 132 transitions. Word has length 115 [2019-08-05 10:54:36,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:36,557 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 132 transitions. [2019-08-05 10:54:36,557 INFO L476 AbstractCegarLoop]: Interpolant automaton has 115 states. [2019-08-05 10:54:36,557 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 132 transitions. [2019-08-05 10:54:36,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2019-08-05 10:54:36,559 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:36,559 INFO L399 BasicCegarLoop]: trace histogram [128, 1, 1, 1] [2019-08-05 10:54:36,559 INFO L418 AbstractCegarLoop]: === Iteration 18 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:36,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:36,559 INFO L82 PathProgramCache]: Analyzing trace with hash 1237429344, now seen corresponding path program 17 times [2019-08-05 10:54:36,560 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:54:36,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:54:36,752 WARN L254 TraceCheckSpWp]: Trace formula consists of 2197 conjuncts, 2106 conjunts are in the unsatisfiable core [2019-08-05 10:54:36,904 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:54:47,556 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:54:47,557 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:54:47,557 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [130] total 130 [2019-08-05 10:54:47,557 INFO L454 AbstractCegarLoop]: Interpolant automaton has 131 states [2019-08-05 10:54:47,558 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 131 interpolants. [2019-08-05 10:54:47,559 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=513, Invalid=16517, Unknown=0, NotChecked=0, Total=17030 [2019-08-05 10:54:47,559 INFO L87 Difference]: Start difference. First operand 132 states and 132 transitions. Second operand 131 states. [2019-08-05 10:54:59,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:54:59,900 INFO L93 Difference]: Finished difference Result 148 states and 148 transitions. [2019-08-05 10:54:59,900 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 131 states. [2019-08-05 10:54:59,900 INFO L78 Accepts]: Start accepts. Automaton has 131 states. Word has length 131 [2019-08-05 10:54:59,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:54:59,902 INFO L225 Difference]: With dead ends: 148 [2019-08-05 10:54:59,902 INFO L226 Difference]: Without dead ends: 148 [2019-08-05 10:54:59,904 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 130 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 9.9s TimeCoverageRelationStatistics Valid=644, Invalid=16648, Unknown=0, NotChecked=0, Total=17292 [2019-08-05 10:54:59,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2019-08-05 10:54:59,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2019-08-05 10:54:59,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148 states. [2019-08-05 10:54:59,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 148 transitions. [2019-08-05 10:54:59,911 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 148 transitions. Word has length 131 [2019-08-05 10:54:59,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:54:59,911 INFO L475 AbstractCegarLoop]: Abstraction has 148 states and 148 transitions. [2019-08-05 10:54:59,911 INFO L476 AbstractCegarLoop]: Interpolant automaton has 131 states. [2019-08-05 10:54:59,911 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 148 transitions. [2019-08-05 10:54:59,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2019-08-05 10:54:59,913 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:54:59,913 INFO L399 BasicCegarLoop]: trace histogram [144, 1, 1, 1] [2019-08-05 10:54:59,914 INFO L418 AbstractCegarLoop]: === Iteration 19 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:54:59,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:54:59,914 INFO L82 PathProgramCache]: Analyzing trace with hash 1299566688, now seen corresponding path program 18 times [2019-08-05 10:54:59,915 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:00,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:00,271 WARN L254 TraceCheckSpWp]: Trace formula consists of 2469 conjuncts, 2386 conjunts are in the unsatisfiable core [2019-08-05 10:55:00,429 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:16,238 INFO L134 CoverageAnalysis]: Checked inductivity of 10440 backedges. 0 proven. 10440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:16,238 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:16,238 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [146] total 146 [2019-08-05 10:55:16,239 INFO L454 AbstractCegarLoop]: Interpolant automaton has 147 states [2019-08-05 10:55:16,239 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 147 interpolants. [2019-08-05 10:55:16,240 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:55:16,241 INFO L87 Difference]: Start difference. First operand 148 states and 148 transitions. Second operand 147 states. [2019-08-05 10:55:32,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:55:32,031 INFO L93 Difference]: Finished difference Result 164 states and 164 transitions. [2019-08-05 10:55:32,032 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 147 states. [2019-08-05 10:55:32,032 INFO L78 Accepts]: Start accepts. Automaton has 147 states. Word has length 147 [2019-08-05 10:55:32,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:55:32,033 INFO L225 Difference]: With dead ends: 164 [2019-08-05 10:55:32,033 INFO L226 Difference]: Without dead ends: 164 [2019-08-05 10:55:32,034 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 145 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 14.9s TimeCoverageRelationStatistics Valid=435, Invalid=21027, Unknown=0, NotChecked=0, Total=21462 [2019-08-05 10:55:32,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2019-08-05 10:55:32,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2019-08-05 10:55:32,039 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 164 states. [2019-08-05 10:55:32,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 164 transitions. [2019-08-05 10:55:32,040 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 164 transitions. Word has length 147 [2019-08-05 10:55:32,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:55:32,040 INFO L475 AbstractCegarLoop]: Abstraction has 164 states and 164 transitions. [2019-08-05 10:55:32,040 INFO L476 AbstractCegarLoop]: Interpolant automaton has 147 states. [2019-08-05 10:55:32,041 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 164 transitions. [2019-08-05 10:55:32,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2019-08-05 10:55:32,043 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:55:32,044 INFO L399 BasicCegarLoop]: trace histogram [160, 1, 1, 1] [2019-08-05 10:55:32,044 INFO L418 AbstractCegarLoop]: === Iteration 20 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:55:32,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:55:32,044 INFO L82 PathProgramCache]: Analyzing trace with hash 1281487968, now seen corresponding path program 19 times [2019-08-05 10:55:32,045 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:55:32,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:55:32,293 WARN L254 TraceCheckSpWp]: Trace formula consists of 2741 conjuncts, 2650 conjunts are in the unsatisfiable core [2019-08-05 10:55:32,474 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:55:51,610 INFO L134 CoverageAnalysis]: Checked inductivity of 12880 backedges. 0 proven. 12880 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:55:51,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:55:51,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [162] total 162 [2019-08-05 10:55:51,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 163 states [2019-08-05 10:55:51,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 163 interpolants. [2019-08-05 10:55:51,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:55:51,612 INFO L87 Difference]: Start difference. First operand 164 states and 164 transitions. Second operand 163 states. [2019-08-05 10:56:10,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:10,612 INFO L93 Difference]: Finished difference Result 180 states and 180 transitions. [2019-08-05 10:56:10,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 163 states. [2019-08-05 10:56:10,613 INFO L78 Accepts]: Start accepts. Automaton has 163 states. Word has length 163 [2019-08-05 10:56:10,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:10,615 INFO L225 Difference]: With dead ends: 180 [2019-08-05 10:56:10,615 INFO L226 Difference]: Without dead ends: 180 [2019-08-05 10:56:10,616 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 161 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 18.1s TimeCoverageRelationStatistics Valid=483, Invalid=25923, Unknown=0, NotChecked=0, Total=26406 [2019-08-05 10:56:10,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2019-08-05 10:56:10,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 180. [2019-08-05 10:56:10,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 180 states. [2019-08-05 10:56:10,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 180 transitions. [2019-08-05 10:56:10,621 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 180 transitions. Word has length 163 [2019-08-05 10:56:10,621 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:10,621 INFO L475 AbstractCegarLoop]: Abstraction has 180 states and 180 transitions. [2019-08-05 10:56:10,621 INFO L476 AbstractCegarLoop]: Interpolant automaton has 163 states. [2019-08-05 10:56:10,621 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 180 transitions. [2019-08-05 10:56:10,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 180 [2019-08-05 10:56:10,624 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:10,624 INFO L399 BasicCegarLoop]: trace histogram [176, 1, 1, 1] [2019-08-05 10:56:10,624 INFO L418 AbstractCegarLoop]: === Iteration 21 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:10,624 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:10,624 INFO L82 PathProgramCache]: Analyzing trace with hash -695855008, now seen corresponding path program 20 times [2019-08-05 10:56:10,625 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:10,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:10,917 WARN L254 TraceCheckSpWp]: Trace formula consists of 3013 conjuncts, 2914 conjunts are in the unsatisfiable core [2019-08-05 10:56:11,112 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 10:56:33,141 INFO L134 CoverageAnalysis]: Checked inductivity of 15576 backedges. 0 proven. 15576 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 10:56:33,141 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 10:56:33,142 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [178] total 178 [2019-08-05 10:56:33,142 INFO L454 AbstractCegarLoop]: Interpolant automaton has 179 states [2019-08-05 10:56:33,143 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 179 interpolants. [2019-08-05 10:56:33,143 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 10:56:33,144 INFO L87 Difference]: Start difference. First operand 180 states and 180 transitions. Second operand 179 states. [2019-08-05 10:56:57,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 10:56:57,119 INFO L93 Difference]: Finished difference Result 196 states and 196 transitions. [2019-08-05 10:56:57,119 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 179 states. [2019-08-05 10:56:57,119 INFO L78 Accepts]: Start accepts. Automaton has 179 states. Word has length 179 [2019-08-05 10:56:57,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 10:56:57,120 INFO L225 Difference]: With dead ends: 196 [2019-08-05 10:56:57,121 INFO L226 Difference]: Without dead ends: 196 [2019-08-05 10:56:57,122 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 177 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 20.9s TimeCoverageRelationStatistics Valid=531, Invalid=31331, Unknown=0, NotChecked=0, Total=31862 [2019-08-05 10:56:57,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2019-08-05 10:56:57,124 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 196. [2019-08-05 10:56:57,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 196 states. [2019-08-05 10:56:57,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 196 states to 196 states and 196 transitions. [2019-08-05 10:56:57,125 INFO L78 Accepts]: Start accepts. Automaton has 196 states and 196 transitions. Word has length 179 [2019-08-05 10:56:57,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 10:56:57,126 INFO L475 AbstractCegarLoop]: Abstraction has 196 states and 196 transitions. [2019-08-05 10:56:57,126 INFO L476 AbstractCegarLoop]: Interpolant automaton has 179 states. [2019-08-05 10:56:57,126 INFO L276 IsEmpty]: Start isEmpty. Operand 196 states and 196 transitions. [2019-08-05 10:56:57,128 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 196 [2019-08-05 10:56:57,128 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 10:56:57,128 INFO L399 BasicCegarLoop]: trace histogram [192, 1, 1, 1] [2019-08-05 10:56:57,129 INFO L418 AbstractCegarLoop]: === Iteration 22 === [ThreeBitCounterErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 10:56:57,129 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 10:56:57,129 INFO L82 PathProgramCache]: Analyzing trace with hash 2078424160, now seen corresponding path program 21 times [2019-08-05 10:56:57,130 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 10:56:57,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 10:56:57,425 WARN L254 TraceCheckSpWp]: Trace formula consists of 3285 conjuncts, 3178 conjunts are in the unsatisfiable core [2019-08-05 10:56:57,648 INFO L279 TraceCheckSpWp]: Computing forward predicates... Received shutdown request... [2019-08-05 10:57:24,083 INFO L177 TraceCheckSpWp]: Timeout while computing interpolants [2019-08-05 10:57:24,084 WARN L544 AbstractCegarLoop]: Verification canceled [2019-08-05 10:57:24,087 WARN L223 ceAbstractionStarter]: Timeout [2019-08-05 10:57:24,088 INFO L202 PluginConnector]: Adding new model CounterExp-16bit.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 10:57:24 BoogieIcfgContainer [2019-08-05 10:57:24,088 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 10:57:24,090 INFO L168 Benchmark]: Toolchain (without parser) took 245233.61 ms. Allocated memory was 131.6 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 108.7 MB in the beginning and 640.3 MB in the end (delta: -531.6 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-08-05 10:57:24,090 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.29 ms. Allocated memory is still 131.6 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. [2019-08-05 10:57:24,091 INFO L168 Benchmark]: Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 131.6 MB. Free memory was 108.7 MB in the beginning and 107.1 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:57:24,092 INFO L168 Benchmark]: Boogie Preprocessor took 28.72 ms. Allocated memory is still 131.6 MB. Free memory was 107.1 MB in the beginning and 105.4 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:57:24,093 INFO L168 Benchmark]: RCFGBuilder took 1777.81 ms. Allocated memory was 131.6 MB in the beginning and 173.0 MB in the end (delta: 41.4 MB). Free memory was 105.4 MB in the beginning and 134.2 MB in the end (delta: -28.8 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. [2019-08-05 10:57:24,094 INFO L168 Benchmark]: TraceAbstraction took 243388.21 ms. Allocated memory was 173.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 134.2 MB in the beginning and 640.3 MB in the end (delta: -506.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-08-05 10:57:24,097 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.29 ms. Allocated memory is still 131.6 MB. Free memory is still 110.1 MB. There was no memory consumed. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 34.16 ms. Allocated memory is still 131.6 MB. Free memory was 108.7 MB in the beginning and 107.1 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 28.72 ms. Allocated memory is still 131.6 MB. Free memory was 107.1 MB in the beginning and 105.4 MB in the end (delta: 1.7 MB). Peak memory consumption was 1.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 1777.81 ms. Allocated memory was 131.6 MB in the beginning and 173.0 MB in the end (delta: 41.4 MB). Free memory was 105.4 MB in the beginning and 134.2 MB in the end (delta: -28.8 MB). Peak memory consumption was 52.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 243388.21 ms. Allocated memory was 173.0 MB in the beginning and 2.7 GB in the end (delta: 2.5 GB). Free memory was 134.2 MB in the beginning and 640.3 MB in the end (delta: -506.2 MB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - TimeoutResultAtElement [Line: 166]: Timeout (TraceAbstraction) Unable to prove that assertion always holds (line 166). Cancelled while BasicCegarLoop was analyzing trace of length 196 with TraceHistMax 192,while TraceCheckSpWp was constructing forward predicates,while PredicateComparison was comparing new predicate (quantifier-free) to 193 known predicates. - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 5 locations, 1 error locations. TIMEOUT Result, 243.3s OverallTime, 22 OverallIterations, 192 TraceHistogramMax, 105.3s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 60 SDtfs, 8 SDslu, 51 SDs, 0 SdLazy, 132451 SolverSat, 1106 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 86.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 1197 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 1162 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 133 ImplicationChecksByTransitivity, 102.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=196occurred in iteration=21, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s AbstIntTime, 0 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 21 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.3s SsaConstructionTime, 1.8s SatisfiabilityAnalysisTime, 108.4s InterpolantComputationTime, 1184 NumberOfCodeBlocks, 1184 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 1163 ConstructedInterpolants, 0 QuantifiedInterpolants, 2212666 SizeOfPredicates, 308 NumberOfNonLiveVariables, 19498 ConjunctsInSsa, 17979 ConjunctsInUnsatCore, 21 InterpolantComputations, 1 PerfectInterpolantSequences, 15/65766 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: Timeout Completed graceful shutdown