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/concurrent/concurrentBoogie/NonAtomicIncrement_2Threads_Loop.bpl -------------------------------------------------------------------------------- This is Ultimate 0.1.24-b8c145f [2019-08-05 09:52:10,038 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-08-05 09:52:10,040 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-08-05 09:52:10,059 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-08-05 09:52:10,059 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-08-05 09:52:10,060 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-08-05 09:52:10,062 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-08-05 09:52:10,064 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-08-05 09:52:10,066 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-08-05 09:52:10,066 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-08-05 09:52:10,067 INFO L181 SettingsManager]: Resetting Symbolic Interpretation preferences to default values [2019-08-05 09:52:10,068 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-08-05 09:52:10,068 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-08-05 09:52:10,069 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-08-05 09:52:10,070 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-08-05 09:52:10,072 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-08-05 09:52:10,073 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-08-05 09:52:10,074 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-08-05 09:52:10,076 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-08-05 09:52:10,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-08-05 09:52:10,080 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-08-05 09:52:10,081 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-08-05 09:52:10,083 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-08-05 09:52:10,084 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-08-05 09:52:10,086 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-08-05 09:52:10,087 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-08-05 09:52:10,087 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-08-05 09:52:10,088 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-08-05 09:52:10,089 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-08-05 09:52:10,090 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-08-05 09:52:10,090 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-08-05 09:52:10,091 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-08-05 09:52:10,092 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-08-05 09:52:10,093 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-08-05 09:52:10,094 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-08-05 09:52:10,095 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-08-05 09:52:10,095 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-08-05 09:52:10,096 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-08-05 09:52:10,096 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-08-05 09:52:10,097 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-08-05 09:52:10,098 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-08-05 09:52:10,125 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-08-05 09:52:10,139 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-08-05 09:52:10,143 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-08-05 09:52:10,145 INFO L271 PluginConnector]: Initializing Boogie PL CUP Parser... [2019-08-05 09:52:10,145 INFO L275 PluginConnector]: Boogie PL CUP Parser initialized [2019-08-05 09:52:10,146 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/NonAtomicIncrement_2Threads_Loop.bpl [2019-08-05 09:52:10,146 INFO L110 BoogieParser]: Parsing: '/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/concurrent/concurrentBoogie/NonAtomicIncrement_2Threads_Loop.bpl' [2019-08-05 09:52:10,182 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-08-05 09:52:10,184 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-08-05 09:52:10,185 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:10,185 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-08-05 09:52:10,185 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-08-05 09:52:10,203 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,212 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,222 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-08-05 09:52:10,223 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-08-05 09:52:10,223 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-08-05 09:52:10,223 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-08-05 09:52:10,234 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,235 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,235 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,236 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,239 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,243 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,244 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/1) ... [2019-08-05 09:52:10,246 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-08-05 09:52:10,247 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-08-05 09:52:10,247 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-08-05 09:52:10,247 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-08-05 09:52:10,248 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (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 09:52:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure fistIncrementProcess [2019-08-05 09:52:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure fistIncrementProcess [2019-08-05 09:52:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-08-05 09:52:10,319 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-08-05 09:52:10,319 INFO L130 BoogieDeclarations]: Found specification of procedure secondIncrementProcess [2019-08-05 09:52:10,320 INFO L138 BoogieDeclarations]: Found implementation of procedure secondIncrementProcess [2019-08-05 09:52:10,321 WARN L201 CfgBuilder]: User set CodeBlockSize to LoopFreeBlock but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-08-05 09:52:10,644 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-08-05 09:52:10,645 INFO L283 CfgBuilder]: Removed 0 assume(true) statements. [2019-08-05 09:52:10,646 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:10 BoogieIcfgContainer [2019-08-05 09:52:10,646 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-08-05 09:52:10,654 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-08-05 09:52:10,654 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-08-05 09:52:10,667 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-08-05 09:52:10,670 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.boogie.parser AST 05.08 09:52:10" (1/2) ... [2019-08-05 09:52:10,672 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1ef6880a and model type NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 05.08 09:52:10, skipping insertion in model container [2019-08-05 09:52:10,673 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 05.08 09:52:10" (2/2) ... [2019-08-05 09:52:10,677 INFO L109 eAbstractionObserver]: Analyzing ICFG NonAtomicIncrement_2Threads_Loop.bpl [2019-08-05 09:52:10,774 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,775 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,778 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,779 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,780 WARN L317 ript$VariableManager]: TermVariabe Thread0_fistIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,780 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,781 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,783 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,784 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_localx not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,784 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,785 WARN L317 ript$VariableManager]: TermVariabe Thread1_secondIncrementProcess_i not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-08-05 09:52:10,832 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:ForwardPredicates Determinization: PREDICATE_ABSTRACTION [2019-08-05 09:52:10,839 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-08-05 09:52:10,856 INFO L252 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-08-05 09:52:10,882 INFO L128 ementStrategyFactory]: Using default assertion order modulation [2019-08-05 09:52:10,883 INFO L377 AbstractCegarLoop]: Interprodecural is true [2019-08-05 09:52:10,883 INFO L378 AbstractCegarLoop]: Hoare is false [2019-08-05 09:52:10,883 INFO L379 AbstractCegarLoop]: Compute interpolants for ForwardPredicates [2019-08-05 09:52:10,883 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-08-05 09:52:10,883 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-08-05 09:52:10,884 INFO L382 AbstractCegarLoop]: Difference is false [2019-08-05 09:52:10,884 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-08-05 09:52:10,884 INFO L388 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-08-05 09:52:10,892 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 23places, 24 transitions [2019-08-05 09:52:10,909 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 76 states. [2019-08-05 09:52:10,911 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states. [2019-08-05 09:52:10,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-08-05 09:52:10,921 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:10,922 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:10,924 INFO L418 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:10,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:10,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1766567994, now seen corresponding path program 1 times [2019-08-05 09:52:10,976 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,014 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:11,068 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 09:52:11,071 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:11,071 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:11,075 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:11,086 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:11,086 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:11,088 INFO L87 Difference]: Start difference. First operand 76 states. Second operand 3 states. [2019-08-05 09:52:11,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,196 INFO L93 Difference]: Finished difference Result 112 states and 219 transitions. [2019-08-05 09:52:11,197 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:11,198 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2019-08-05 09:52:11,199 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,212 INFO L225 Difference]: With dead ends: 112 [2019-08-05 09:52:11,213 INFO L226 Difference]: Without dead ends: 110 [2019-08-05 09:52:11,215 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 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 09:52:11,234 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2019-08-05 09:52:11,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 83. [2019-08-05 09:52:11,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83 states. [2019-08-05 09:52:11,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 163 transitions. [2019-08-05 09:52:11,265 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 163 transitions. Word has length 12 [2019-08-05 09:52:11,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,266 INFO L475 AbstractCegarLoop]: Abstraction has 83 states and 163 transitions. [2019-08-05 09:52:11,266 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:11,266 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 163 transitions. [2019-08-05 09:52:11,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-08-05 09:52:11,268 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,268 INFO L399 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,269 INFO L418 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,270 INFO L82 PathProgramCache]: Analyzing trace with hash -1836145399, now seen corresponding path program 1 times [2019-08-05 09:52:11,271 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,283 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,284 INFO L256 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,286 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:11,355 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 09:52:11,356 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:11,356 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:11,358 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:11,358 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:11,359 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:11,359 INFO L87 Difference]: Start difference. First operand 83 states and 163 transitions. Second operand 4 states. [2019-08-05 09:52:11,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,423 INFO L93 Difference]: Finished difference Result 146 states and 289 transitions. [2019-08-05 09:52:11,424 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:11,424 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-08-05 09:52:11,425 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,427 INFO L225 Difference]: With dead ends: 146 [2019-08-05 09:52:11,427 INFO L226 Difference]: Without dead ends: 146 [2019-08-05 09:52:11,428 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:11,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2019-08-05 09:52:11,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 119. [2019-08-05 09:52:11,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 119 states. [2019-08-05 09:52:11,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 235 transitions. [2019-08-05 09:52:11,446 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 235 transitions. Word has length 16 [2019-08-05 09:52:11,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,447 INFO L475 AbstractCegarLoop]: Abstraction has 119 states and 235 transitions. [2019-08-05 09:52:11,447 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:11,447 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 235 transitions. [2019-08-05 09:52:11,449 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-08-05 09:52:11,449 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,449 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,449 INFO L418 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,450 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1025072948, now seen corresponding path program 2 times [2019-08-05 09:52:11,451 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,465 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,467 INFO L256 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,468 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:11,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 09:52:11,504 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:11,504 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-08-05 09:52:11,504 INFO L454 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-08-05 09:52:11,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-08-05 09:52:11,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-08-05 09:52:11,505 INFO L87 Difference]: Start difference. First operand 119 states and 235 transitions. Second operand 3 states. [2019-08-05 09:52:11,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,538 INFO L93 Difference]: Finished difference Result 171 states and 339 transitions. [2019-08-05 09:52:11,542 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-08-05 09:52:11,542 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2019-08-05 09:52:11,542 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,544 INFO L225 Difference]: With dead ends: 171 [2019-08-05 09:52:11,556 INFO L226 Difference]: Without dead ends: 171 [2019-08-05 09:52:11,556 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 18 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 09:52:11,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 171 states. [2019-08-05 09:52:11,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 171 to 132. [2019-08-05 09:52:11,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132 states. [2019-08-05 09:52:11,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 261 transitions. [2019-08-05 09:52:11,582 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 261 transitions. Word has length 20 [2019-08-05 09:52:11,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,583 INFO L475 AbstractCegarLoop]: Abstraction has 132 states and 261 transitions. [2019-08-05 09:52:11,583 INFO L476 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-08-05 09:52:11,584 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 261 transitions. [2019-08-05 09:52:11,588 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2019-08-05 09:52:11,588 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,589 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,589 INFO L418 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,589 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,589 INFO L82 PathProgramCache]: Analyzing trace with hash 340384335, now seen corresponding path program 1 times [2019-08-05 09:52:11,592 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,619 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 3 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,621 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:11,696 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 09:52:11,696 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:11,696 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4] total 4 [2019-08-05 09:52:11,697 INFO L454 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-08-05 09:52:11,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-08-05 09:52:11,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:11,698 INFO L87 Difference]: Start difference. First operand 132 states and 261 transitions. Second operand 4 states. [2019-08-05 09:52:11,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,742 INFO L93 Difference]: Finished difference Result 223 states and 443 transitions. [2019-08-05 09:52:11,743 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-08-05 09:52:11,743 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 24 [2019-08-05 09:52:11,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,745 INFO L225 Difference]: With dead ends: 223 [2019-08-05 09:52:11,745 INFO L226 Difference]: Without dead ends: 223 [2019-08-05 09:52:11,746 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-08-05 09:52:11,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 223 states. [2019-08-05 09:52:11,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 223 to 184. [2019-08-05 09:52:11,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2019-08-05 09:52:11,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 365 transitions. [2019-08-05 09:52:11,759 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 365 transitions. Word has length 24 [2019-08-05 09:52:11,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,760 INFO L475 AbstractCegarLoop]: Abstraction has 184 states and 365 transitions. [2019-08-05 09:52:11,760 INFO L476 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-08-05 09:52:11,760 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 365 transitions. [2019-08-05 09:52:11,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-08-05 09:52:11,762 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,762 INFO L399 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,763 INFO L418 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,763 INFO L82 PathProgramCache]: Analyzing trace with hash 647928402, now seen corresponding path program 2 times [2019-08-05 09:52:11,764 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,782 INFO L256 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,784 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:11,852 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2019-08-05 09:52:11,853 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:11,853 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:52:11,853 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:11,854 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:11,854 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:11,854 INFO L87 Difference]: Start difference. First operand 184 states and 365 transitions. Second operand 5 states. [2019-08-05 09:52:11,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:11,912 INFO L93 Difference]: Finished difference Result 240 states and 477 transitions. [2019-08-05 09:52:11,914 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:11,914 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-08-05 09:52:11,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:11,915 INFO L225 Difference]: With dead ends: 240 [2019-08-05 09:52:11,915 INFO L226 Difference]: Without dead ends: 240 [2019-08-05 09:52:11,916 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:11,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2019-08-05 09:52:11,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 240. [2019-08-05 09:52:11,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 240 states. [2019-08-05 09:52:11,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 240 states to 240 states and 477 transitions. [2019-08-05 09:52:11,934 INFO L78 Accepts]: Start accepts. Automaton has 240 states and 477 transitions. Word has length 28 [2019-08-05 09:52:11,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:11,935 INFO L475 AbstractCegarLoop]: Abstraction has 240 states and 477 transitions. [2019-08-05 09:52:11,935 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:11,935 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 477 transitions. [2019-08-05 09:52:11,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-08-05 09:52:11,940 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:11,941 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:11,941 INFO L418 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:11,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:11,941 INFO L82 PathProgramCache]: Analyzing trace with hash -1314649707, now seen corresponding path program 3 times [2019-08-05 09:52:11,942 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:11,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:11,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2019-08-05 09:52:11,963 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:12,164 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2019-08-05 09:52:12,165 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:12,165 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5] total 5 [2019-08-05 09:52:12,166 INFO L454 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-08-05 09:52:12,166 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-08-05 09:52:12,166 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:12,167 INFO L87 Difference]: Start difference. First operand 240 states and 477 transitions. Second operand 5 states. [2019-08-05 09:52:12,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:12,224 INFO L93 Difference]: Finished difference Result 308 states and 613 transitions. [2019-08-05 09:52:12,225 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-08-05 09:52:12,225 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 32 [2019-08-05 09:52:12,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:12,227 INFO L225 Difference]: With dead ends: 308 [2019-08-05 09:52:12,227 INFO L226 Difference]: Without dead ends: 308 [2019-08-05 09:52:12,228 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-08-05 09:52:12,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 308 states. [2019-08-05 09:52:12,249 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 308 to 308. [2019-08-05 09:52:12,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 308 states. [2019-08-05 09:52:12,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 308 states to 308 states and 613 transitions. [2019-08-05 09:52:12,255 INFO L78 Accepts]: Start accepts. Automaton has 308 states and 613 transitions. Word has length 32 [2019-08-05 09:52:12,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:12,257 INFO L475 AbstractCegarLoop]: Abstraction has 308 states and 613 transitions. [2019-08-05 09:52:12,257 INFO L476 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-08-05 09:52:12,257 INFO L276 IsEmpty]: Start isEmpty. Operand 308 states and 613 transitions. [2019-08-05 09:52:12,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:12,260 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:12,260 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:12,261 INFO L418 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:12,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:12,264 INFO L82 PathProgramCache]: Analyzing trace with hash 555988632, now seen corresponding path program 4 times [2019-08-05 09:52:12,265 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:12,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:12,298 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjunts are in the unsatisfiable core [2019-08-05 09:52:12,300 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:12,725 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 30 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:12,725 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-08-05 09:52:12,725 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2019-08-05 09:52:12,726 INFO L454 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-08-05 09:52:12,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-08-05 09:52:12,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=156, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:12,728 INFO L87 Difference]: Start difference. First operand 308 states and 613 transitions. Second operand 15 states. [2019-08-05 09:52:14,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:14,324 INFO L93 Difference]: Finished difference Result 1129 states and 2254 transitions. [2019-08-05 09:52:14,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-08-05 09:52:14,326 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 36 [2019-08-05 09:52:14,326 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:14,329 INFO L225 Difference]: With dead ends: 1129 [2019-08-05 09:52:14,330 INFO L226 Difference]: Without dead ends: 572 [2019-08-05 09:52:14,331 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=278, Invalid=534, Unknown=0, NotChecked=0, Total=812 [2019-08-05 09:52:14,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-08-05 09:52:14,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 365. [2019-08-05 09:52:14,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 365 states. [2019-08-05 09:52:14,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 365 states to 365 states and 719 transitions. [2019-08-05 09:52:14,343 INFO L78 Accepts]: Start accepts. Automaton has 365 states and 719 transitions. Word has length 36 [2019-08-05 09:52:14,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:14,343 INFO L475 AbstractCegarLoop]: Abstraction has 365 states and 719 transitions. [2019-08-05 09:52:14,344 INFO L476 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-08-05 09:52:14,344 INFO L276 IsEmpty]: Start isEmpty. Operand 365 states and 719 transitions. [2019-08-05 09:52:14,345 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:14,345 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:14,346 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:14,346 INFO L418 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:14,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:14,346 INFO L82 PathProgramCache]: Analyzing trace with hash -2099799818, now seen corresponding path program 5 times [2019-08-05 09:52:14,347 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:14,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:14,368 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:14,370 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:14,610 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:14,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:14,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:14,611 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:14,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:14,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:14,612 INFO L87 Difference]: Start difference. First operand 365 states and 719 transitions. Second operand 13 states. [2019-08-05 09:52:15,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:15,742 INFO L93 Difference]: Finished difference Result 1051 states and 2075 transitions. [2019-08-05 09:52:15,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:52:15,742 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 09:52:15,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:15,746 INFO L225 Difference]: With dead ends: 1051 [2019-08-05 09:52:15,746 INFO L226 Difference]: Without dead ends: 491 [2019-08-05 09:52:15,747 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=208, Invalid=392, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:15,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 491 states. [2019-08-05 09:52:15,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 491 to 331. [2019-08-05 09:52:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 331 states. [2019-08-05 09:52:15,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 331 states to 331 states and 645 transitions. [2019-08-05 09:52:15,761 INFO L78 Accepts]: Start accepts. Automaton has 331 states and 645 transitions. Word has length 36 [2019-08-05 09:52:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:15,768 INFO L475 AbstractCegarLoop]: Abstraction has 331 states and 645 transitions. [2019-08-05 09:52:15,768 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:15,769 INFO L276 IsEmpty]: Start isEmpty. Operand 331 states and 645 transitions. [2019-08-05 09:52:15,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:15,770 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:15,771 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:15,771 INFO L418 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:15,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:15,773 INFO L82 PathProgramCache]: Analyzing trace with hash -730251632, now seen corresponding path program 6 times [2019-08-05 09:52:15,774 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:15,808 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:15,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:15,813 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:15,994 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:15,994 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:15,995 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:15,995 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:15,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:15,996 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:15,996 INFO L87 Difference]: Start difference. First operand 331 states and 645 transitions. Second operand 13 states. [2019-08-05 09:52:16,497 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:16,498 INFO L93 Difference]: Finished difference Result 1357 states and 2666 transitions. [2019-08-05 09:52:16,498 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:52:16,499 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 09:52:16,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:16,505 INFO L225 Difference]: With dead ends: 1357 [2019-08-05 09:52:16,505 INFO L226 Difference]: Without dead ends: 1011 [2019-08-05 09:52:16,506 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=204, Invalid=396, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:16,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1011 states. [2019-08-05 09:52:16,521 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1011 to 550. [2019-08-05 09:52:16,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 550 states. [2019-08-05 09:52:16,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 1085 transitions. [2019-08-05 09:52:16,523 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 1085 transitions. Word has length 36 [2019-08-05 09:52:16,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:16,524 INFO L475 AbstractCegarLoop]: Abstraction has 550 states and 1085 transitions. [2019-08-05 09:52:16,524 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:16,524 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 1085 transitions. [2019-08-05 09:52:16,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:16,526 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:16,526 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:16,526 INFO L418 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:16,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:16,527 INFO L82 PathProgramCache]: Analyzing trace with hash -1946657392, now seen corresponding path program 7 times [2019-08-05 09:52:16,528 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:16,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:16,543 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:16,545 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:16,648 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:16,648 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:16,649 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:52:16,649 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:16,649 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:16,649 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:16,650 INFO L87 Difference]: Start difference. First operand 550 states and 1085 transitions. Second operand 11 states. [2019-08-05 09:52:16,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:16,921 INFO L93 Difference]: Finished difference Result 976 states and 1894 transitions. [2019-08-05 09:52:16,921 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:16,922 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-05 09:52:16,922 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:16,927 INFO L225 Difference]: With dead ends: 976 [2019-08-05 09:52:16,927 INFO L226 Difference]: Without dead ends: 782 [2019-08-05 09:52:16,928 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=133, Invalid=247, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:16,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 782 states. [2019-08-05 09:52:16,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 782 to 488. [2019-08-05 09:52:16,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 488 states. [2019-08-05 09:52:16,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 488 states to 488 states and 952 transitions. [2019-08-05 09:52:16,942 INFO L78 Accepts]: Start accepts. Automaton has 488 states and 952 transitions. Word has length 36 [2019-08-05 09:52:16,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:16,942 INFO L475 AbstractCegarLoop]: Abstraction has 488 states and 952 transitions. [2019-08-05 09:52:16,942 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:16,942 INFO L276 IsEmpty]: Start isEmpty. Operand 488 states and 952 transitions. [2019-08-05 09:52:16,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:16,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:16,944 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:16,944 INFO L418 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:16,945 INFO L82 PathProgramCache]: Analyzing trace with hash 550501520, now seen corresponding path program 8 times [2019-08-05 09:52:16,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:16,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:16,961 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 8 conjunts are in the unsatisfiable core [2019-08-05 09:52:16,962 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,030 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 14 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2019-08-05 09:52:17,031 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:17,031 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2019-08-05 09:52:17,031 INFO L454 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-08-05 09:52:17,031 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-08-05 09:52:17,032 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-08-05 09:52:17,032 INFO L87 Difference]: Start difference. First operand 488 states and 952 transitions. Second operand 9 states. [2019-08-05 09:52:17,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:17,309 INFO L93 Difference]: Finished difference Result 728 states and 1403 transitions. [2019-08-05 09:52:17,309 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-08-05 09:52:17,310 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 36 [2019-08-05 09:52:17,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:17,313 INFO L225 Difference]: With dead ends: 728 [2019-08-05 09:52:17,313 INFO L226 Difference]: Without dead ends: 451 [2019-08-05 09:52:17,314 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=76, Invalid=134, Unknown=0, NotChecked=0, Total=210 [2019-08-05 09:52:17,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2019-08-05 09:52:17,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 297. [2019-08-05 09:52:17,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 297 states. [2019-08-05 09:52:17,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 571 transitions. [2019-08-05 09:52:17,322 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 571 transitions. Word has length 36 [2019-08-05 09:52:17,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:17,322 INFO L475 AbstractCegarLoop]: Abstraction has 297 states and 571 transitions. [2019-08-05 09:52:17,323 INFO L476 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-08-05 09:52:17,323 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 571 transitions. [2019-08-05 09:52:17,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:17,324 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:17,324 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:17,324 INFO L418 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:17,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:17,325 INFO L82 PathProgramCache]: Analyzing trace with hash -1959098582, now seen corresponding path program 9 times [2019-08-05 09:52:17,325 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:17,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:17,339 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:17,341 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:17,656 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:17,657 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:17,657 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:17,657 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:17,657 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:17,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:17,658 INFO L87 Difference]: Start difference. First operand 297 states and 571 transitions. Second operand 13 states. [2019-08-05 09:52:18,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,149 INFO L93 Difference]: Finished difference Result 982 states and 1931 transitions. [2019-08-05 09:52:18,150 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-08-05 09:52:18,150 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 09:52:18,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,153 INFO L225 Difference]: With dead ends: 982 [2019-08-05 09:52:18,154 INFO L226 Difference]: Without dead ends: 495 [2019-08-05 09:52:18,154 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=192, Invalid=360, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:52:18,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 495 states. [2019-08-05 09:52:18,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 495 to 318. [2019-08-05 09:52:18,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 318 states. [2019-08-05 09:52:18,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 614 transitions. [2019-08-05 09:52:18,165 INFO L78 Accepts]: Start accepts. Automaton has 318 states and 614 transitions. Word has length 36 [2019-08-05 09:52:18,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,166 INFO L475 AbstractCegarLoop]: Abstraction has 318 states and 614 transitions. [2019-08-05 09:52:18,166 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:18,166 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 614 transitions. [2019-08-05 09:52:18,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:18,167 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,168 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:18,168 INFO L418 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,168 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,169 INFO L82 PathProgramCache]: Analyzing trace with hash -109341104, now seen corresponding path program 10 times [2019-08-05 09:52:18,170 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,183 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,185 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:18,574 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:18,574 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:18,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:18,574 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:18,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:18,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:18,575 INFO L87 Difference]: Start difference. First operand 318 states and 614 transitions. Second operand 13 states. [2019-08-05 09:52:18,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:18,932 INFO L93 Difference]: Finished difference Result 960 states and 1883 transitions. [2019-08-05 09:52:18,932 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:52:18,933 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 09:52:18,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:18,935 INFO L225 Difference]: With dead ends: 960 [2019-08-05 09:52:18,935 INFO L226 Difference]: Without dead ends: 395 [2019-08-05 09:52:18,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 51 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=190, Invalid=362, Unknown=0, NotChecked=0, Total=552 [2019-08-05 09:52:18,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 395 states. [2019-08-05 09:52:18,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 395 to 274. [2019-08-05 09:52:18,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 274 states. [2019-08-05 09:52:18,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 274 states to 274 states and 526 transitions. [2019-08-05 09:52:18,942 INFO L78 Accepts]: Start accepts. Automaton has 274 states and 526 transitions. Word has length 36 [2019-08-05 09:52:18,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:18,943 INFO L475 AbstractCegarLoop]: Abstraction has 274 states and 526 transitions. [2019-08-05 09:52:18,943 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:18,943 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 526 transitions. [2019-08-05 09:52:18,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:18,944 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:18,944 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:18,944 INFO L418 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:18,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:18,945 INFO L82 PathProgramCache]: Analyzing trace with hash 884253302, now seen corresponding path program 11 times [2019-08-05 09:52:18,945 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:18,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:18,957 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 12 conjunts are in the unsatisfiable core [2019-08-05 09:52:18,959 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,088 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:19,089 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,089 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2019-08-05 09:52:19,089 INFO L454 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-08-05 09:52:19,090 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-08-05 09:52:19,090 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2019-08-05 09:52:19,090 INFO L87 Difference]: Start difference. First operand 274 states and 526 transitions. Second operand 13 states. [2019-08-05 09:52:19,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,453 INFO L93 Difference]: Finished difference Result 896 states and 1759 transitions. [2019-08-05 09:52:19,454 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2019-08-05 09:52:19,454 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 36 [2019-08-05 09:52:19,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,456 INFO L225 Difference]: With dead ends: 896 [2019-08-05 09:52:19,457 INFO L226 Difference]: Without dead ends: 413 [2019-08-05 09:52:19,457 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=209, Invalid=391, Unknown=0, NotChecked=0, Total=600 [2019-08-05 09:52:19,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2019-08-05 09:52:19,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 256. [2019-08-05 09:52:19,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 256 states. [2019-08-05 09:52:19,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 480 transitions. [2019-08-05 09:52:19,466 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 480 transitions. Word has length 36 [2019-08-05 09:52:19,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,467 INFO L475 AbstractCegarLoop]: Abstraction has 256 states and 480 transitions. [2019-08-05 09:52:19,467 INFO L476 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-08-05 09:52:19,467 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 480 transitions. [2019-08-05 09:52:19,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-08-05 09:52:19,468 INFO L391 BasicCegarLoop]: Found error trace [2019-08-05 09:52:19,468 INFO L399 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-08-05 09:52:19,468 INFO L418 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONASSERT]=== [2019-08-05 09:52:19,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-08-05 09:52:19,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1615194316, now seen corresponding path program 12 times [2019-08-05 09:52:19,469 INFO L69 tionRefinementEngine]: Using refinement strategy FixedRefinementStrategy [2019-08-05 09:52:19,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-08-05 09:52:19,480 INFO L256 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 10 conjunts are in the unsatisfiable core [2019-08-05 09:52:19,482 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-08-05 09:52:19,629 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 28 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-08-05 09:52:19,630 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 1 imperfect interpolant sequences. [2019-08-05 09:52:19,630 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2019-08-05 09:52:19,630 INFO L454 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-08-05 09:52:19,630 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-08-05 09:52:19,630 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2019-08-05 09:52:19,631 INFO L87 Difference]: Start difference. First operand 256 states and 480 transitions. Second operand 11 states. [2019-08-05 09:52:19,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-08-05 09:52:19,934 INFO L93 Difference]: Finished difference Result 413 states and 770 transitions. [2019-08-05 09:52:19,935 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-08-05 09:52:19,935 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 36 [2019-08-05 09:52:19,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-08-05 09:52:19,935 INFO L225 Difference]: With dead ends: 413 [2019-08-05 09:52:19,935 INFO L226 Difference]: Without dead ends: 0 [2019-08-05 09:52:19,936 INFO L628 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=136, Invalid=244, Unknown=0, NotChecked=0, Total=380 [2019-08-05 09:52:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-08-05 09:52:19,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-08-05 09:52:19,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-08-05 09:52:19,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-08-05 09:52:19,936 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 36 [2019-08-05 09:52:19,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-08-05 09:52:19,937 INFO L475 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-08-05 09:52:19,937 INFO L476 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-08-05 09:52:19,937 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-08-05 09:52:19,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-08-05 09:52:19,940 INFO L303 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-08-05 09:52:19,941 INFO L202 PluginConnector]: Adding new model NonAtomicIncrement_2Threads_Loop.bpl de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 05.08 09:52:19 BasicIcfg [2019-08-05 09:52:19,941 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-08-05 09:52:19,944 INFO L168 Benchmark]: Toolchain (without parser) took 9759.23 ms. Allocated memory was 135.3 MB in the beginning and 261.6 MB in the end (delta: 126.4 MB). Free memory was 111.6 MB in the beginning and 183.4 MB in the end (delta: -71.8 MB). Peak memory consumption was 54.6 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,945 INFO L168 Benchmark]: Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,946 INFO L168 Benchmark]: Boogie Procedure Inliner took 37.22 ms. Allocated memory is still 135.3 MB. Free memory was 111.6 MB in the beginning and 109.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,947 INFO L168 Benchmark]: Boogie Preprocessor took 23.53 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 108.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,948 INFO L168 Benchmark]: RCFGBuilder took 399.73 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 98.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,949 INFO L168 Benchmark]: TraceAbstraction took 9287.50 ms. Allocated memory was 135.3 MB in the beginning and 261.6 MB in the end (delta: 126.4 MB). Free memory was 97.9 MB in the beginning and 183.4 MB in the end (delta: -85.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. [2019-08-05 09:52:19,953 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * Boogie PL CUP Parser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 112.9 MB in the beginning and 112.7 MB in the end (delta: 209.7 kB). Peak memory consumption was 209.7 kB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 37.22 ms. Allocated memory is still 135.3 MB. Free memory was 111.6 MB in the beginning and 109.8 MB in the end (delta: 1.9 MB). Peak memory consumption was 1.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 23.53 ms. Allocated memory is still 135.3 MB. Free memory was 109.8 MB in the beginning and 108.6 MB in the end (delta: 1.2 MB). Peak memory consumption was 1.2 MB. Max. memory is 7.1 GB. * RCFGBuilder took 399.73 ms. Allocated memory is still 135.3 MB. Free memory was 108.6 MB in the beginning and 98.1 MB in the end (delta: 10.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 7.1 GB. * TraceAbstraction took 9287.50 ms. Allocated memory was 135.3 MB in the beginning and 261.6 MB in the end (delta: 126.4 MB). Free memory was 97.9 MB in the beginning and 183.4 MB in the end (delta: -85.5 MB). Peak memory consumption was 40.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: assertion always holds For all program executions holds that assertion always holds at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 37 locations, 1 error locations. SAFE Result, 9.0s OverallTime, 15 OverallIterations, 3 TraceHistogramMax, 5.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 868 SDtfs, 1857 SDslu, 3189 SDs, 0 SdLazy, 1444 SolverSat, 255 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 537 GetRequests, 336 SyntacticMatches, 0 SemanticMatches, 201 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 441 ImplicationChecksByTransitivity, 4.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=550occurred in iteration=9, 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.2s AutomataMinimizationTime, 15 MinimizatonAttempts, 1863 StatesRemovedByMinimization, 12 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 2.5s InterpolantComputationTime, 456 NumberOfCodeBlocks, 456 NumberOfCodeBlocksAsserted, 15 NumberOfCheckSat, 441 ConstructedInterpolants, 0 QuantifiedInterpolants, 37485 SizeOfPredicates, 90 NumberOfNonLiveVariables, 798 ConjunctsInSsa, 120 ConjunctsInUnsatCore, 15 InterpolantComputations, 3 PerfectInterpolantSequences, 268/317 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...