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-tiling/poly1.c -------------------------------------------------------------------------------- This is Ultimate 0.1.24-13a467a-m [2019-10-14 23:52:52,242 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-14 23:52:52,245 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-14 23:52:52,263 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-14 23:52:52,263 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-14 23:52:52,265 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-14 23:52:52,267 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-14 23:52:52,276 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-14 23:52:52,280 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-14 23:52:52,284 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-14 23:52:52,284 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-14 23:52:52,286 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-14 23:52:52,286 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-14 23:52:52,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-14 23:52:52,290 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-14 23:52:52,291 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-14 23:52:52,292 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-14 23:52:52,294 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-14 23:52:52,295 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-14 23:52:52,300 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-14 23:52:52,303 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-14 23:52:52,306 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-14 23:52:52,308 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-14 23:52:52,309 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-14 23:52:52,311 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-14 23:52:52,311 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-14 23:52:52,311 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-14 23:52:52,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-14 23:52:52,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-14 23:52:52,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-14 23:52:52,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-14 23:52:52,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-14 23:52:52,316 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-14 23:52:52,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-14 23:52:52,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-14 23:52:52,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-14 23:52:52,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-14 23:52:52,319 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-14 23:52:52,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-14 23:52:52,320 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-14 23:52:52,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-14 23:52:52,322 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:52:52,356 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-14 23:52:52,357 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-14 23:52:52,358 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-14 23:52:52,358 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-14 23:52:52,358 INFO L138 SettingsManager]: * Use SBE=true [2019-10-14 23:52:52,358 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-14 23:52:52,361 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-14 23:52:52,361 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-14 23:52:52,361 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-14 23:52:52,361 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-14 23:52:52,362 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-14 23:52:52,362 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-14 23:52:52,362 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-14 23:52:52,362 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-14 23:52:52,362 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-14 23:52:52,363 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-14 23:52:52,363 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-14 23:52:52,363 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-14 23:52:52,364 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-14 23:52:52,364 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-14 23:52:52,364 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-14 23:52:52,365 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-14 23:52:52,365 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-14 23:52:52,365 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-14 23:52:52,365 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-14 23:52:52,366 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-14 23:52:52,366 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-14 23:52:52,366 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-14 23:52:52,366 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:52:52,652 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-14 23:52:52,664 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-14 23:52:52,667 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-14 23:52:52,668 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-14 23:52:52,669 INFO L275 PluginConnector]: CDTParser initialized [2019-10-14 23:52:52,669 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/array-tiling/poly1.c [2019-10-14 23:52:52,728 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807c96857/2d50fd9d15f2496d8c02c8a80244a569/FLAGcc1212b04 [2019-10-14 23:52:53,138 INFO L306 CDTParser]: Found 1 translation units. [2019-10-14 23:52:53,139 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/array-tiling/poly1.c [2019-10-14 23:52:53,144 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807c96857/2d50fd9d15f2496d8c02c8a80244a569/FLAGcc1212b04 [2019-10-14 23:52:53,554 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/807c96857/2d50fd9d15f2496d8c02c8a80244a569 [2019-10-14 23:52:53,564 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-14 23:52:53,565 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2019-10-14 23:52:53,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:53,566 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-14 23:52:53,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-14 23:52:53,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,573 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3dddacd7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53, skipping insertion in model container [2019-10-14 23:52:53,574 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,581 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-14 23:52:53,597 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-14 23:52:53,754 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:53,765 INFO L188 MainTranslator]: Completed pre-run [2019-10-14 23:52:53,783 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-14 23:52:53,799 INFO L192 MainTranslator]: Completed translation [2019-10-14 23:52:53,799 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53 WrapperNode [2019-10-14 23:52:53,799 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-14 23:52:53,800 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-14 23:52:53,800 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-14 23:52:53,800 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-14 23:52:53,895 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,895 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,903 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,904 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,910 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,915 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,916 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (1/1) ... [2019-10-14 23:52:53,918 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-14 23:52:53,919 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-14 23:52:53,919 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-14 23:52:53,919 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-14 23:52:53,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (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:52:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2019-10-14 23:52:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-14 23:52:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2019-10-14 23:52:53,980 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2019-10-14 23:52:53,980 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_error [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assume [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure malloc [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure main [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-14 23:52:53,981 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-14 23:52:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-14 23:52:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2019-10-14 23:52:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-14 23:52:53,982 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-10-14 23:52:54,270 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-14 23:52:54,271 INFO L284 CfgBuilder]: Removed 2 assume(true) statements. [2019-10-14 23:52:54,272 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:54 BoogieIcfgContainer [2019-10-14 23:52:54,272 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-14 23:52:54,273 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-14 23:52:54,273 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-14 23:52:54,276 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-14 23:52:54,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 14.10 11:52:53" (1/3) ... [2019-10-14 23:52:54,277 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dc1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:54, skipping insertion in model container [2019-10-14 23:52:54,277 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 14.10 11:52:53" (2/3) ... [2019-10-14 23:52:54,278 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@53dc1fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 14.10 11:52:54, skipping insertion in model container [2019-10-14 23:52:54,278 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 14.10 11:52:54" (3/3) ... [2019-10-14 23:52:54,280 INFO L109 eAbstractionObserver]: Analyzing ICFG poly1.c [2019-10-14 23:52:54,289 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-14 23:52:54,296 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-14 23:52:54,308 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-14 23:52:54,332 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-14 23:52:54,333 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-14 23:52:54,333 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-14 23:52:54,333 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-14 23:52:54,333 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-14 23:52:54,333 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-14 23:52:54,334 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-14 23:52:54,334 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-14 23:52:54,351 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states. [2019-10-14 23:52:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:54,357 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:54,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:54,360 INFO L410 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:54,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:54,366 INFO L82 PathProgramCache]: Analyzing trace with hash -516860939, now seen corresponding path program 1 times [2019-10-14 23:52:54,375 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:54,375 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2073275101] [2019-10-14 23:52:54,375 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:54,376 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:54,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:54,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:54,501 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:52:54,502 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2073275101] [2019-10-14 23:52:54,502 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:54,503 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-14 23:52:54,503 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523331084] [2019-10-14 23:52:54,506 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-14 23:52:54,508 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:54,521 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-14 23:52:54,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-14 23:52:54,526 INFO L87 Difference]: Start difference. First operand 25 states. Second operand 2 states. [2019-10-14 23:52:54,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:54,556 INFO L93 Difference]: Finished difference Result 41 states and 49 transitions. [2019-10-14 23:52:54,556 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-14 23:52:54,558 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 14 [2019-10-14 23:52:54,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:54,569 INFO L225 Difference]: With dead ends: 41 [2019-10-14 23:52:54,569 INFO L226 Difference]: Without dead ends: 20 [2019-10-14 23:52:54,576 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:52:54,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2019-10-14 23:52:54,621 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2019-10-14 23:52:54,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2019-10-14 23:52:54,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 21 transitions. [2019-10-14 23:52:54,628 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 21 transitions. Word has length 14 [2019-10-14 23:52:54,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:54,630 INFO L462 AbstractCegarLoop]: Abstraction has 20 states and 21 transitions. [2019-10-14 23:52:54,630 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-14 23:52:54,631 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 21 transitions. [2019-10-14 23:52:54,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-14 23:52:54,633 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:54,634 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:54,634 INFO L410 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:54,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:54,635 INFO L82 PathProgramCache]: Analyzing trace with hash -1546915729, now seen corresponding path program 1 times [2019-10-14 23:52:54,636 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:54,636 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969158162] [2019-10-14 23:52:54,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:54,636 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:54,637 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:54,710 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-14 23:52:54,712 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1654229977] [2019-10-14 23:52:54,712 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:52:54,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:54,812 INFO L256 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 3 conjunts are in the unsatisfiable core [2019-10-14 23:52:54,818 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:54,858 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:52:54,859 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:54,882 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:52:54,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969158162] [2019-10-14 23:52:54,883 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-14 23:52:54,883 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1654229977] [2019-10-14 23:52:54,884 INFO L223 tionRefinementEngine]: Constructing automaton from 2 perfect and 0 imperfect interpolant sequences. [2019-10-14 23:52:54,884 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3, 3] imperfect sequences [] total 4 [2019-10-14 23:52:54,884 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [764368617] [2019-10-14 23:52:54,886 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:52:54,886 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy TAIPAN [2019-10-14 23:52:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:52:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:52:54,887 INFO L87 Difference]: Start difference. First operand 20 states and 21 transitions. Second operand 4 states. [2019-10-14 23:52:54,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:52:54,963 INFO L93 Difference]: Finished difference Result 34 states and 37 transitions. [2019-10-14 23:52:54,964 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-14 23:52:54,964 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-14 23:52:54,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:52:54,965 INFO L225 Difference]: With dead ends: 34 [2019-10-14 23:52:54,965 INFO L226 Difference]: Without dead ends: 23 [2019-10-14 23:52:54,966 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 25 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:52:54,967 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23 states. [2019-10-14 23:52:54,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23 to 23. [2019-10-14 23:52:54,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2019-10-14 23:52:54,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 24 transitions. [2019-10-14 23:52:54,973 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 24 transitions. Word has length 14 [2019-10-14 23:52:54,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:52:54,973 INFO L462 AbstractCegarLoop]: Abstraction has 23 states and 24 transitions. [2019-10-14 23:52:54,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:52:54,974 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 24 transitions. [2019-10-14 23:52:54,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-10-14 23:52:54,974 INFO L372 BasicCegarLoop]: Found error trace [2019-10-14 23:52:54,975 INFO L380 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-14 23:52:55,178 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:55,179 INFO L410 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-14 23:52:55,179 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:52:55,179 INFO L82 PathProgramCache]: Analyzing trace with hash -600111765, now seen corresponding path program 1 times [2019-10-14 23:52:55,180 INFO L157 tionRefinementEngine]: Executing refinement strategy TAIPAN [2019-10-14 23:52:55,180 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668512559] [2019-10-14 23:52:55,180 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:55,181 INFO L116 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-10-14 23:52:55,181 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-14 23:52:55,195 ERROR L273 tionRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2019-10-14 23:52:55,195 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [826115762] [2019-10-14 23:52:55,196 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:52:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-14 23:52:55,253 INFO L256 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 16 conjunts are in the unsatisfiable core [2019-10-14 23:52:55,256 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-10-14 23:52:55,315 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 24 [2019-10-14 23:52:55,316 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,460 WARN L191 SmtUtils]: Spent 141.00 ms on a formula simplification. DAG size of input: 28 DAG size of output: 16 [2019-10-14 23:52:55,461 INFO L567 ElimStorePlain]: treesize reduction 36, result has 34.5 percent of original size [2019-10-14 23:52:55,461 INFO L464 ElimStorePlain]: Eliminatee |v_#memory_int_6| vanished before elimination [2019-10-14 23:52:55,461 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,462 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:59, output treesize:19 [2019-10-14 23:52:55,562 INFO L341 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2019-10-14 23:52:55,563 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2019-10-14 23:52:55,564 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,571 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-10-14 23:52:55,571 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,572 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:17 [2019-10-14 23:52:55,614 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:55,629 WARN L225 Elim1Store]: Array PQE input equivalent to false [2019-10-14 23:52:55,630 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,666 INFO L341 Elim1Store]: treesize reduction 10, result has 75.6 percent of original size [2019-10-14 23:52:55,667 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 48 [2019-10-14 23:52:55,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,683 INFO L567 ElimStorePlain]: treesize reduction 32, result has 17.9 percent of original size [2019-10-14 23:52:55,683 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:55,684 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:79, output treesize:7 [2019-10-14 23:52:55,754 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:52:55,755 INFO L321 TraceCheckSpWp]: Computing backward predicates... [2019-10-14 23:52:57,353 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:57,355 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:52:57,378 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-10-14 23:52:57,389 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:52:57,394 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:52:57,401 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2019-10-14 23:52:57,402 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2019-10-14 23:52:57,946 WARN L191 SmtUtils]: Spent 543.00 ms on a formula simplification. DAG size of input: 18 DAG size of output: 11 [2019-10-14 23:52:57,946 INFO L567 ElimStorePlain]: treesize reduction 12, result has 55.6 percent of original size [2019-10-14 23:52:57,947 INFO L496 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:57,953 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 40 [2019-10-14 23:52:57,962 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:52:57,982 INFO L172 IndexEqualityManager]: detected equality via solver [2019-10-14 23:52:57,987 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2019-10-14 23:52:57,988 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 2 xjuncts. [2019-10-14 23:52:58,125 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 16 DAG size of output: 10 [2019-10-14 23:52:58,126 INFO L567 ElimStorePlain]: treesize reduction 10, result has 54.5 percent of original size [2019-10-14 23:52:58,126 INFO L496 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:52:59,148 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 68 [2019-10-14 23:53:01,174 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 443 [2019-10-14 23:53:01,175 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,176 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,178 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,179 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,181 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,182 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,183 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,185 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,186 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,187 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,188 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,189 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,191 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,193 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,195 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,197 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,199 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,201 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,203 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,204 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,205 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,206 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,208 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,211 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,212 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,213 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,214 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,215 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,217 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,218 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,219 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,220 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,221 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,222 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,223 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,225 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,226 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,228 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,229 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,230 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,231 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,232 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-10-14 23:53:01,236 INFO L496 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2019-10-14 23:53:21,825 WARN L191 SmtUtils]: Spent 20.59 s on a formula simplification. DAG size of input: 66 DAG size of output: 17 [2019-10-14 23:53:21,826 INFO L567 ElimStorePlain]: treesize reduction 1770, result has 1.5 percent of original size [2019-10-14 23:53:21,826 INFO L496 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:53:26,078 WARN L191 SmtUtils]: Spent 4.25 s on a formula simplification. DAG size of input: 24 DAG size of output: 9 [2019-10-14 23:53:26,079 INFO L567 ElimStorePlain]: treesize reduction 40, result has 27.3 percent of original size [2019-10-14 23:53:26,079 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-10-14 23:53:26,079 INFO L221 ElimStorePlain]: Needed 7 recursive calls to eliminate 3 variables, input treesize:157, output treesize:15 [2019-10-14 23:53:26,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-14 23:53:26,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668512559] [2019-10-14 23:53:26,213 INFO L337 tionRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: Unknown [2019-10-14 23:53:26,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [826115762] [2019-10-14 23:53:26,213 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleAbstractInterpretation [624556841] [2019-10-14 23:53:26,220 INFO L211 CegarAbsIntRunner]: Running AI on error trace of length 19 [2019-10-14 23:53:26,255 INFO L148 AbstractInterpreter]: Using domain IntervalDomain [2019-10-14 23:53:26,255 INFO L101 FixpointEngine]: Starting fixpoint engine with domain IntervalDomain (maxUnwinding=3, maxParallelStates=2) [2019-10-14 23:53:26,317 INFO L266 AbstractInterpreter]: Error location(s) were unreachable [2019-10-14 23:53:26,319 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 24 variables. [2019-10-14 23:53:26,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-14 23:53:26,322 INFO L536 sIntCurrentIteration]: Generating AbsInt predicates [2019-10-14 23:53:26,354 INFO L227 lantSequenceWeakener]: Weakened 5 states. On average, predicates are now at 77.5% of their original sizes. [2019-10-14 23:53:26,355 INFO L551 sIntCurrentIteration]: Unifying AI predicates [2019-10-14 23:53:26,361 INFO L553 sIntCurrentIteration]: We unified 17 AI predicates to 17 [2019-10-14 23:53:26,361 INFO L562 sIntCurrentIteration]: Finished generation of AbsInt predicates [2019-10-14 23:53:26,362 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 2 imperfect interpolant sequences. [2019-10-14 23:53:26,362 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [10, 10] total 20 [2019-10-14 23:53:26,362 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899700259] [2019-10-14 23:53:26,363 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-14 23:53:26,364 INFO L137 tionRefinementEngine]: Using predicate unifier AbsIntPredicateUnifier provided by strategy TAIPAN [2019-10-14 23:53:26,364 INFO L124 tionRefinementEngine]: Using hoare triple checker CachingHoareTripleCheckerMap provided by strategy [2019-10-14 23:53:26,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-14 23:53:26,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-10-14 23:53:26,365 INFO L87 Difference]: Start difference. First operand 23 states and 24 transitions. Second operand 4 states. [2019-10-14 23:53:26,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-14 23:53:26,368 INFO L93 Difference]: Finished difference Result 23 states and 24 transitions. [2019-10-14 23:53:26,368 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-10-14 23:53:26,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2019-10-14 23:53:26,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-14 23:53:26,369 INFO L225 Difference]: With dead ends: 23 [2019-10-14 23:53:26,369 INFO L226 Difference]: Without dead ends: 0 [2019-10-14 23:53:26,370 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 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:53:26,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-14 23:53:26,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-14 23:53:26,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-14 23:53:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-14 23:53:26,371 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2019-10-14 23:53:26,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-14 23:53:26,371 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-14 23:53:26,371 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-14 23:53:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-14 23:53:26,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-14 23:53:26,572 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-10-14 23:53:26,578 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-14 23:53:26,653 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:26,654 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:26,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:26,654 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-14 23:53:26,654 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:53:26,654 INFO L446 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2019-10-14 23:53:26,655 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-14 23:53:26,655 INFO L439 ceAbstractionStarter]: At program point L27(line 27) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:26,655 INFO L443 ceAbstractionStarter]: For program point L27-1(line 27) no Hoare annotation was computed. [2019-10-14 23:53:26,655 INFO L443 ceAbstractionStarter]: For program point mainEXIT(lines 11 31) no Hoare annotation was computed. [2019-10-14 23:53:26,655 INFO L443 ceAbstractionStarter]: For program point L25-2(lines 25 28) no Hoare annotation was computed. [2019-10-14 23:53:26,656 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:53:26,656 INFO L443 ceAbstractionStarter]: For program point L19-2(lines 19 22) no Hoare annotation was computed. [2019-10-14 23:53:26,656 INFO L439 ceAbstractionStarter]: At program point L19-3(lines 19 22) the Hoare annotation is: (or (not (<= |old(~SIZE~0)| 2147483647)) (not (= 100000 ~MAX~0)) (not (<= 0 (+ |old(~SIZE~0)| 2147483648)))) [2019-10-14 23:53:26,656 INFO L443 ceAbstractionStarter]: For program point L19-4(lines 19 22) no Hoare annotation was computed. [2019-10-14 23:53:26,656 INFO L443 ceAbstractionStarter]: For program point mainFINAL(lines 11 31) no Hoare annotation was computed. [2019-10-14 23:53:26,657 INFO L439 ceAbstractionStarter]: At program point mainENTRY(lines 11 31) 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:53:26,657 INFO L443 ceAbstractionStarter]: For program point L14(lines 14 29) no Hoare annotation was computed. [2019-10-14 23:53:26,657 INFO L443 ceAbstractionStarter]: For program point L14-1(lines 14 29) no Hoare annotation was computed. [2019-10-14 23:53:26,657 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2019-10-14 23:53:26,657 INFO L443 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:26,657 INFO L446 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2019-10-14 23:53:26,658 INFO L443 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2019-10-14 23:53:26,658 INFO L443 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2019-10-14 23:53:26,658 INFO L443 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2019-10-14 23:53:26,670 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 14.10 11:53:26 BoogieIcfgContainer [2019-10-14 23:53:26,670 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-14 23:53:26,672 INFO L168 Benchmark]: Toolchain (without parser) took 33106.91 ms. Allocated memory was 144.7 MB in the beginning and 234.4 MB in the end (delta: 89.7 MB). Free memory was 102.7 MB in the beginning and 108.4 MB in the end (delta: -5.7 MB). Peak memory consumption was 84.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:26,673 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 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:53:26,674 INFO L168 Benchmark]: CACSL2BoogieTranslator took 233.69 ms. Allocated memory is still 144.7 MB. Free memory was 102.5 MB in the beginning and 92.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:26,675 INFO L168 Benchmark]: Boogie Preprocessor took 118.21 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.0 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:26,676 INFO L168 Benchmark]: RCFGBuilder took 353.60 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 165.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:26,677 INFO L168 Benchmark]: TraceAbstraction took 32397.01 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 164.6 MB in the beginning and 108.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 88.8 MB. Max. memory is 7.1 GB. [2019-10-14 23:53:26,680 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 144.7 MB. Free memory was 121.1 MB in the beginning and 120.9 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 233.69 ms. Allocated memory is still 144.7 MB. Free memory was 102.5 MB in the beginning and 92.6 MB in the end (delta: 9.9 MB). Peak memory consumption was 9.9 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 118.21 ms. Allocated memory was 144.7 MB in the beginning and 201.9 MB in the end (delta: 57.1 MB). Free memory was 92.6 MB in the beginning and 180.0 MB in the end (delta: -87.5 MB). Peak memory consumption was 10.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 353.60 ms. Allocated memory is still 201.9 MB. Free memory was 180.0 MB in the beginning and 165.3 MB in the end (delta: 14.7 MB). Peak memory consumption was 14.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 32397.01 ms. Allocated memory was 201.9 MB in the beginning and 234.4 MB in the end (delta: 32.5 MB). Free memory was 164.6 MB in the beginning and 108.4 MB in the end (delta: 56.3 MB). Peak memory consumption was 88.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: 25]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: (!(\old(SIZE) <= 2147483647) || !(100000 == MAX)) || !(0 <= \old(SIZE) + 2147483648) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 25 locations, 1 error locations. Result: SAFE, OverallTime: 32.3s, OverallIterations: 3, TraceHistogramMax: 2, AutomataDifference: 0.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 51 SDtfs, 7 SDslu, 20 SDs, 0 SdLazy, 20 SolverSat, 4 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=25occurred in iteration=0, 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, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 8 LocationsWithAnnotation, 10 PreInvPairs, 10 NumberOfFragments, 84 HoareAnnotationTreeSize, 10 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 8 FomulaSimplificationsInter, 3 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 31.0s InterpolantComputationTime, 46 NumberOfCodeBlocks, 46 NumberOfCodeBlocksAsserted, 3 NumberOfCheckSat, 73 ConstructedInterpolants, 0 QuantifiedInterpolants, 5371 SizeOfPredicates, 12 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 19 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 0/8 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: TIME[ms]: 102, ITERATIONS: 1, WAS_STRONG: 1, WEAKENING_RATIO: 0.9558823529411765, AVG_VARS_REMOVED_DURING_WEAKENING: 0.9411764705882353, AVG_WEAKENED_CONJUNCTS: 1.2941176470588236, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...