java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf --abstractinterpretationv2.abstract.domain IntervalDomain --traceabstraction.trace.refinement.strategy TAIPAN --traceabstraction.abstract.interpretation.mode USE_PREDICATES -i ../../../trunk/examples/svcomp/array-crafted/zero_sum_const4.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:51:50,203 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:51:50,207 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:51:50,228 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:51:50,229 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:51:50,232 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:51:50,234 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:51:50,244 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:51:50,248 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:51:50,252 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:51:50,253 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:51:50,255 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:51:50,255 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:51:50,257 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:51:50,260 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:51:50,262 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:51:50,264 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:51:50,266 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:51:50,267 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:51:50,272 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:51:50,276 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:51:50,280 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:51:50,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:51:50,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:51:50,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:51:50,286 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:51:50,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:51:50,287 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:51:50,289 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:51:50,290 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:51:50,290 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:51:50,291 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:51:50,291 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:51:50,292 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:51:50,293 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:51:50,294 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:51:50,294 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:51:50,295 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:51:50,295 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:51:50,296 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:51:50,297 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:51:50,298 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-14 23:51:50,334 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:51:50,336 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:51:50,338 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:51:50,340 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:51:50,341 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:51:50,341 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:51:50,341 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:51:50,341 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:51:50,341 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:51:50,342 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:51:50,342 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:51:50,342 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:51:50,342 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:51:50,342 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:51:50,343 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:51:50,343 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:51:50,343 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:51:50,345 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:51:50,346 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:51:50,346 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:51:50,346 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:51:50,346 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:50,346 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:51:50,347 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:51:50,347 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:51:50,347 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:51:50,347 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:51:50,347 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:51:50,348 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.analysis.abstractinterpretationv2: Abstract domain -> IntervalDomain Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Trace refinement strategy -> TAIPAN Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: Abstract interpretation Mode -> USE_PREDICATES [2019-10-14 23:51:50,658 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:51:50,675 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:51:50,679 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:51:50,681 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:51:50,682 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:51:50,682 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-crafted/zero_sum_const4.c [2019-10-14 23:51:50,762 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f57ecd8a/259a1a6b0432438dbac21ee47d9e2ed6/FLAGb63219187 [2019-10-14 23:51:51,284 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:51:51,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-crafted/zero_sum_const4.c [2019-10-14 23:51:51,296 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f57ecd8a/259a1a6b0432438dbac21ee47d9e2ed6/FLAGb63219187 [2019-10-14 23:51:51,672 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f57ecd8a/259a1a6b0432438dbac21ee47d9e2ed6 [2019-10-14 23:51:51,681 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:51:51,682 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:51:51,683 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:51,683 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:51:51,687 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:51:51,688 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,690 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7142d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:51, skipping insertion in model container [2019-10-14 23:51:51,691 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:51:51" (1/1) ... [2019-10-14 23:51:51,699 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:51:51,718 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:51:51,932 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:51,945 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:51:51,970 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:51:52,075 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:51:52,076 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52 WrapperNode [2019-10-14 23:51:52,076 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:51:52,077 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:51:52,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:51:52,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:51:52,091 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,092 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,098 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,099 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,108 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,117 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,119 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (1/1) ... [2019-10-14 23:51:52,121 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:51:52,122 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:51:52,122 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:51:52,122 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:51:52,123 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (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:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:51:52,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:51:52,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:51:52,192 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:51:52,192 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:51:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:51:52,192 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_long [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:51:52,193 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:51:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:51:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:51:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:51:52,194 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:51:52,592 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:51:52,592 INFO L284 CfgBuilder]: Removed 9 assume(true) statements. [2019-10-14 23:51:52,594 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52 BoogieIcfgContainer [2019-10-14 23:51:52,594 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:51:52,595 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:51:52,595 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:51:52,599 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:51:52,599 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:51:51" (1/3) ... [2019-10-14 23:51:52,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bec973c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:51:52" (2/3) ... [2019-10-14 23:51:52,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6bec973c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:51:52, skipping insertion in model container [2019-10-14 23:51:52,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:51:52" (3/3) ... [2019-10-14 23:51:52,603 INFO L109 eAbstractionObserver]: Analyzing ICFG zero_sum_const4.c [2019-10-14 23:51:52,611 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:51:52,619 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:51:52,630 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:51:52,656 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:51:52,656 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:51:52,657 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:51:52,657 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:51:52,657 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:51:52,657 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:51:52,658 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:51:52,658 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:51:52,679 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states. [2019-10-14 23:51:52,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:51:52,689 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,690 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,693 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,705 INFO L82 PathProgramCache]: Analyzing trace with hash 299774862, now seen corresponding path program 1 times [2019-10-14 23:51:52,713 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,714 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967563052] [2019-10-14 23:51:52,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,714 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,714 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:52,811 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:52,857 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:51:52,858 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967563052] [2019-10-14 23:51:52,859 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:52,860 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:51:52,860 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [443436182] [2019-10-14 23:51:52,865 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:51:52,867 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:52,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:51:52,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:51:52,886 INFO L87 Difference]: Start difference. First operand 45 states. Second operand 2 states. [2019-10-14 23:51:52,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:52,929 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2019-10-14 23:51:52,930 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:51:52,931 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 28 [2019-10-14 23:51:52,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:52,942 INFO L225 Difference]: With dead ends: 81 [2019-10-14 23:51:52,942 INFO L226 Difference]: Without dead ends: 38 [2019-10-14 23:51:52,949 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:51:52,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2019-10-14 23:51:52,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2019-10-14 23:51:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38 states. [2019-10-14 23:51:52,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 46 transitions. [2019-10-14 23:51:52,990 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 46 transitions. Word has length 28 [2019-10-14 23:51:52,990 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:52,990 INFO L462 AbstractCegarLoop]: Abstraction has 38 states and 46 transitions. [2019-10-14 23:51:52,991 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:51:52,991 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2019-10-14 23:51:52,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-10-14 23:51:52,992 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:52,993 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:52,993 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:52,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:52,994 INFO L82 PathProgramCache]: Analyzing trace with hash 268068598, now seen corresponding path program 1 times [2019-10-14 23:51:52,994 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:52,994 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52961006] [2019-10-14 23:51:52,994 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,995 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:52,995 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:51:53,140 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52961006] [2019-10-14 23:51:53,141 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,141 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-10-14 23:51:53,141 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083649652] [2019-10-14 23:51:53,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-10-14 23:51:53,144 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-10-14 23:51:53,145 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-10-14 23:51:53,145 INFO L87 Difference]: Start difference. First operand 38 states and 46 transitions. Second operand 5 states. [2019-10-14 23:51:53,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,261 INFO L93 Difference]: Finished difference Result 58 states and 73 transitions. [2019-10-14 23:51:53,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-14 23:51:53,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 28 [2019-10-14 23:51:53,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,264 INFO L225 Difference]: With dead ends: 58 [2019-10-14 23:51:53,264 INFO L226 Difference]: Without dead ends: 53 [2019-10-14 23:51:53,266 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-10-14 23:51:53,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2019-10-14 23:51:53,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2019-10-14 23:51:53,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-10-14 23:51:53,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2019-10-14 23:51:53,291 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 28 [2019-10-14 23:51:53,291 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,291 INFO L462 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2019-10-14 23:51:53,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-10-14 23:51:53,292 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2019-10-14 23:51:53,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-10-14 23:51:53,293 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,294 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,294 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,294 INFO L82 PathProgramCache]: Analyzing trace with hash 962591476, now seen corresponding path program 1 times [2019-10-14 23:51:53,295 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,295 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [145515901] [2019-10-14 23:51:53,295 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,296 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,296 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,410 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2019-10-14 23:51:53,411 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [145515901] [2019-10-14 23:51:53,411 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,411 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-14 23:51:53,412 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45989258] [2019-10-14 23:51:53,412 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-10-14 23:51:53,413 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-10-14 23:51:53,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-10-14 23:51:53,414 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand 3 states. [2019-10-14 23:51:53,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,507 INFO L93 Difference]: Finished difference Result 99 states and 129 transitions. [2019-10-14 23:51:53,508 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:53,508 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 30 [2019-10-14 23:51:53,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,509 INFO L225 Difference]: With dead ends: 99 [2019-10-14 23:51:53,509 INFO L226 Difference]: Without dead ends: 55 [2019-10-14 23:51:53,510 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-10-14 23:51:53,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2019-10-14 23:51:53,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2019-10-14 23:51:53,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2019-10-14 23:51:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 69 transitions. [2019-10-14 23:51:53,523 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 69 transitions. Word has length 30 [2019-10-14 23:51:53,523 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,523 INFO L462 AbstractCegarLoop]: Abstraction has 54 states and 69 transitions. [2019-10-14 23:51:53,523 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-10-14 23:51:53,524 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 69 transitions. [2019-10-14 23:51:53,525 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2019-10-14 23:51:53,525 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,525 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,526 INFO L410 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,526 INFO L82 PathProgramCache]: Analyzing trace with hash -1516091022, now seen corresponding path program 1 times [2019-10-14 23:51:53,526 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,527 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [258071872] [2019-10-14 23:51:53,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,527 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,527 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,620 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-10-14 23:51:53,621 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [258071872] [2019-10-14 23:51:53,621 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:51:53,621 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-14 23:51:53,621 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616941774] [2019-10-14 23:51:53,622 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:53,622 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:53,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:53,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:53,623 INFO L87 Difference]: Start difference. First operand 54 states and 69 transitions. Second operand 4 states. [2019-10-14 23:51:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:53,758 INFO L93 Difference]: Finished difference Result 95 states and 123 transitions. [2019-10-14 23:51:53,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:51:53,761 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 32 [2019-10-14 23:51:53,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:53,762 INFO L225 Difference]: With dead ends: 95 [2019-10-14 23:51:53,762 INFO L226 Difference]: Without dead ends: 56 [2019-10-14 23:51:53,774 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 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-10-14 23:51:53,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2019-10-14 23:51:53,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 47. [2019-10-14 23:51:53,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2019-10-14 23:51:53,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2019-10-14 23:51:53,789 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 55 transitions. Word has length 32 [2019-10-14 23:51:53,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:53,790 INFO L462 AbstractCegarLoop]: Abstraction has 47 states and 55 transitions. [2019-10-14 23:51:53,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:53,790 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 55 transitions. [2019-10-14 23:51:53,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2019-10-14 23:51:53,794 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:51:53,794 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:51:53,794 INFO L410 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:51:53,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:53,795 INFO L82 PathProgramCache]: Analyzing trace with hash 94574052, now seen corresponding path program 1 times [2019-10-14 23:51:53,795 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:51:53,796 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [486598916] [2019-10-14 23:51:53,796 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,797 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:51:53,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:51:53,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,919 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:51:53,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [486598916] [2019-10-14 23:51:53,920 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654607646] [2019-10-14 23:51:53,921 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:53,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:51:53,999 INFO L256 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2019-10-14 23:51:54,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:51:54,080 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:51:54,080 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:51:54,127 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-10-14 23:51:54,128 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [891554324] [2019-10-14 23:51:54,135 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 47 [2019-10-14 23:51:54,190 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:51:54,190 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:51:54,270 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:51:54,272 INFO L272 AbstractInterpreter]: Visited 7 different actions 7 times. Never merged. Never widened. Performed 24 root evaluator evaluations with a maximum evaluation depth of 3. Performed 24 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Never found a fixpoint. Largest state had 40 variables. [2019-10-14 23:51:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:51:54,275 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:51:54,321 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:51:54,322 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:51:54,333 INFO L553 sIntCurrentIteration]: We unified 45 AI predicates to 45 [2019-10-14 23:51:54,334 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:51:54,334 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 3 imperfect interpolant sequences. [2019-10-14 23:51:54,335 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [4, 4, 4] total 9 [2019-10-14 23:51:54,335 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [680859294] [2019-10-14 23:51:54,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:51:54,337 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:51:54,337 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:51:54,337 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:51:54,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:51:54,338 INFO L87 Difference]: Start difference. First operand 47 states and 55 transitions. Second operand 4 states. [2019-10-14 23:51:54,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:51:54,341 INFO L93 Difference]: Finished difference Result 47 states and 55 transitions. [2019-10-14 23:51:54,342 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:51:54,342 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 46 [2019-10-14 23:51:54,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:51:54,342 INFO L225 Difference]: With dead ends: 47 [2019-10-14 23:51:54,342 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:51:54,343 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 43 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-10-14 23:51:54,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:51:54,343 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:51:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:51:54,344 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:51:54,344 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 46 [2019-10-14 23:51:54,344 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:51:54,344 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:51:54,344 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:51:54,345 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:51:54,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:51:54,549 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:51:54,555 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:51:54,678 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,679 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,679 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,679 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,679 INFO L439 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647) (= ~MAX~0 100000)) [2019-10-14 23:51:54,679 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:51:54,679 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:51:54,680 INFO L443 ceAbstractionStarter]: For program point L35-2(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,680 INFO L439 ceAbstractionStarter]: At program point L35-3(lines 35 38) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,680 INFO L443 ceAbstractionStarter]: For program point L35-4(lines 35 38) no Hoare annotation was computed. [2019-10-14 23:51:54,680 INFO L443 ceAbstractionStarter]: For program point L60-2(lines 60 63) no Hoare annotation was computed. [2019-10-14 23:51:54,680 INFO L439 ceAbstractionStarter]: At program point L60-3(lines 60 63) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,680 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 67) no Hoare annotation was computed. [2019-10-14 23:51:54,681 INFO L439 ceAbstractionStarter]: At program point L60-4(lines 60 63) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (= main_~sum~0 0) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,681 INFO L443 ceAbstractionStarter]: For program point L20-2(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,681 INFO L439 ceAbstractionStarter]: At program point L20-3(lines 20 23) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,681 INFO L443 ceAbstractionStarter]: For program point L20-4(lines 20 23) no Hoare annotation was computed. [2019-10-14 23:51:54,681 INFO L443 ceAbstractionStarter]: For program point L45-2(lines 45 48) no Hoare annotation was computed. [2019-10-14 23:51:54,682 INFO L439 ceAbstractionStarter]: At program point L45-3(lines 45 48) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,682 INFO L443 ceAbstractionStarter]: For program point L45-4(lines 45 48) no Hoare annotation was computed. [2019-10-14 23:51:54,682 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 67) no Hoare annotation was computed. [2019-10-14 23:51:54,682 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 67) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648))) (and (<= 0 (+ ~SIZE~0 2147483648)) (<= ~SIZE~0 2147483647))) [2019-10-14 23:51:54,682 INFO L443 ceAbstractionStarter]: For program point L30-2(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,683 INFO L439 ceAbstractionStarter]: At program point L30-3(lines 30 33) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,683 INFO L443 ceAbstractionStarter]: For program point L30-4(lines 30 33) no Hoare annotation was computed. [2019-10-14 23:51:54,683 INFO L443 ceAbstractionStarter]: For program point L55-2(lines 55 58) no Hoare annotation was computed. [2019-10-14 23:51:54,683 INFO L439 ceAbstractionStarter]: At program point L55-3(lines 55 58) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,683 INFO L443 ceAbstractionStarter]: For program point L55-4(lines 55 58) no Hoare annotation was computed. [2019-10-14 23:51:54,683 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 65) no Hoare annotation was computed. [2019-10-14 23:51:54,683 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 65) no Hoare annotation was computed. [2019-10-14 23:51:54,684 INFO L443 ceAbstractionStarter]: For program point L40-2(lines 40 43) no Hoare annotation was computed. [2019-10-14 23:51:54,684 INFO L439 ceAbstractionStarter]: At program point L40-3(lines 40 43) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,684 INFO L443 ceAbstractionStarter]: For program point L40-4(lines 40 43) no Hoare annotation was computed. [2019-10-14 23:51:54,684 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,684 INFO L439 ceAbstractionStarter]: At program point L25-3(lines 25 28) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,684 INFO L443 ceAbstractionStarter]: For program point L25-4(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:51:54,684 INFO L443 ceAbstractionStarter]: For program point L50-2(lines 50 53) no Hoare annotation was computed. [2019-10-14 23:51:54,685 INFO L439 ceAbstractionStarter]: At program point L50-3(lines 50 53) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:51:54,685 INFO L443 ceAbstractionStarter]: For program point L50-4(lines 50 53) no Hoare annotation was computed. [2019-10-14 23:51:54,685 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,685 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:51:54,685 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,685 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,686 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,686 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:51:54,702 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:51:54 BoogieIcfgContainer [2019-10-14 23:51:54,702 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:51:54,706 INFO L168 Benchmark]: Toolchain (without parser) took 3021.82 ms. Allocated memory was 144.2 MB in the beginning and 231.7 MB in the end (delta: 87.6 MB). Free memory was 102.2 MB in the beginning and 136.7 MB in the end (delta: -34.5 MB). Peak memory consumption was 53.1 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,707 INFO L168 Benchmark]: CDTParser took 1.18 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,711 INFO L168 Benchmark]: CACSL2BoogieTranslator took 393.40 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 179.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,712 INFO L168 Benchmark]: Boogie Preprocessor took 44.17 ms. Allocated memory is still 200.8 MB. Free memory was 179.4 MB in the beginning and 176.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,712 INFO L168 Benchmark]: RCFGBuilder took 472.02 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 157.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,714 INFO L168 Benchmark]: TraceAbstraction took 2106.79 ms. Allocated memory was 200.8 MB in the beginning and 231.7 MB in the end (delta: 30.9 MB). Free memory was 156.6 MB in the beginning and 136.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:51:54,720 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.18 ms. Allocated memory is still 144.2 MB. Free memory was 120.6 MB in the beginning and 120.3 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 393.40 ms. Allocated memory was 144.2 MB in the beginning and 200.8 MB in the end (delta: 56.6 MB). Free memory was 102.0 MB in the beginning and 179.4 MB in the end (delta: -77.4 MB). Peak memory consumption was 19.4 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 44.17 ms. Allocated memory is still 200.8 MB. Free memory was 179.4 MB in the beginning and 176.9 MB in the end (delta: 2.5 MB). Peak memory consumption was 2.5 MB. Max. memory is 7.1 GB. * RCFGBuilder took 472.02 ms. Allocated memory is still 200.8 MB. Free memory was 176.9 MB in the beginning and 157.3 MB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 2106.79 ms. Allocated memory was 200.8 MB in the beginning and 231.7 MB in the end (delta: 30.9 MB). Free memory was 156.6 MB in the beginning and 136.7 MB in the end (delta: 19.9 MB). Peak memory consumption was 50.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 30]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 60]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 50]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 45]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 40]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 35]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 45 locations, 1 error locations. Result: SAFE, OverallTime: 2.0s, OverallIterations: 5, TraceHistogramMax: 1, AutomataDifference: 0.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 160 SDtfs, 61 SDslu, 120 SDs, 0 SdLazy, 134 SolverSat, 24 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=54occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 15 LocationsWithAnnotation, 19 PreInvPairs, 20 NumberOfFragments, 192 HoareAnnotationTreeSize, 19 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 15 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 210 NumberOfCodeBlocks, 210 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 249 ConstructedInterpolants, 0 QuantifiedInterpolants, 13147 SizeOfPredicates, 3 NumberOfNonLiveVariables, 143 ConjunctsInSsa, 4 ConjunctsInUnsatCore, 7 InterpolantComputations, 4 PerfectInterpolantSequences, 27/30 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 141, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9805555555555555, AVG_VARS_REMOVED_DURING_WEAKENING: 0.8444444444444444, AVG_WEAKENED_CONJUNCTS: 0.4888888888888889, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...