./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 2e94e6aa Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash cb3e7c70ff280d693624878e8ba9ec05355aa785 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-2e94e6a [2019-01-01 21:44:12,006 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:44:12,008 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:44:12,020 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:44:12,021 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:44:12,022 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:44:12,023 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:44:12,025 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:44:12,027 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:44:12,028 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:44:12,029 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:44:12,029 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:44:12,030 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:44:12,031 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:44:12,032 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:44:12,033 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:44:12,034 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:44:12,036 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:44:12,038 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:44:12,040 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:44:12,041 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:44:12,043 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:44:12,045 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:44:12,045 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:44:12,045 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:44:12,046 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:44:12,048 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:44:12,048 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:44:12,049 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:44:12,051 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:44:12,051 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:44:12,052 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:44:12,052 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:44:12,052 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:44:12,053 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:44:12,054 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:44:12,054 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-01-01 21:44:12,071 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:44:12,071 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:44:12,072 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:44:12,073 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:44:12,073 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:44:12,073 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:44:12,074 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:44:12,074 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:44:12,074 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:44:12,074 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:44:12,074 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:44:12,074 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:44:12,075 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:44:12,077 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:44:12,077 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:44:12,077 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:44:12,078 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:44:12,078 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:44:12,078 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:44:12,078 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:44:12,078 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:44:12,078 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:44:12,079 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:44:12,080 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:44:12,081 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> cb3e7c70ff280d693624878e8ba9ec05355aa785 [2019-01-01 21:44:12,116 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:44:12,129 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:44:12,133 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:44:12,135 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:44:12,135 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:44:12,136 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:44:12,195 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dfc92d3/65d2218e3bef4c1aad0ec85f2d6e11be/FLAG7b7201ba1 [2019-01-01 21:44:12,668 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:44:12,669 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:44:12,682 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dfc92d3/65d2218e3bef4c1aad0ec85f2d6e11be/FLAG7b7201ba1 [2019-01-01 21:44:13,005 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/11dfc92d3/65d2218e3bef4c1aad0ec85f2d6e11be [2019-01-01 21:44:13,008 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:44:13,009 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:44:13,011 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:13,011 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:44:13,015 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:44:13,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,021 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b6b9528 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13, skipping insertion in model container [2019-01-01 21:44:13,022 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,030 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:44:13,083 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:44:13,482 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:13,500 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:44:13,689 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:44:13,751 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:44:13,751 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13 WrapperNode [2019-01-01 21:44:13,751 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:44:13,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:13,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:44:13,753 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:44:13,764 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,780 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,809 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:44:13,810 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:44:13,810 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:44:13,811 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:44:13,821 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,822 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,829 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,830 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,841 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,852 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,855 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... [2019-01-01 21:44:13,857 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:44:13,862 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:44:13,862 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:44:13,862 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:44:13,863 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:44:13,929 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:44:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:44:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:44:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:44:13,930 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:44:13,930 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:44:14,266 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:44:14,266 INFO L280 CfgBuilder]: Removed 9 assue(true) statements. [2019-01-01 21:44:14,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:14 BoogieIcfgContainer [2019-01-01 21:44:14,267 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:44:14,268 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:44:14,268 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:44:14,272 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:44:14,273 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:14,274 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:44:13" (1/3) ... [2019-01-01 21:44:14,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d02e8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:14, skipping insertion in model container [2019-01-01 21:44:14,275 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:14,275 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:44:13" (2/3) ... [2019-01-01 21:44:14,275 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4d02e8e7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:44:14, skipping insertion in model container [2019-01-01 21:44:14,277 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:44:14,277 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:14" (3/3) ... [2019-01-01 21:44:14,279 INFO L375 chiAutomizerObserver]: Analyzing ICFG HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i [2019-01-01 21:44:14,357 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:44:14,358 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:44:14,358 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:44:14,358 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:44:14,358 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:44:14,359 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:44:14,359 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:44:14,359 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:44:14,359 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:44:14,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:44:14,396 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:44:14,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:14,396 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:14,403 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:14,403 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:44:14,403 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:44:14,403 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states. [2019-01-01 21:44:14,405 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2019-01-01 21:44:14,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:44:14,405 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:44:14,405 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:44:14,406 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1] [2019-01-01 21:44:14,413 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];~x~0.base, ~x~0.offset := 0, 0; 3#L-1true havoc main_#res;havoc main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet7, main_#t~ret8, main_#t~ret9, main_#t~mem6;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.allocOnStack(4);~x~0.base, ~x~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset;call write~int(main_#t~nondet5, ~x~0.base, ~x~0.offset, 4);havoc main_#t~nondet5; 5#L555-2true [2019-01-01 21:44:14,413 INFO L796 eck$LassoCheckResult]: Loop: 5#L555-2true call main_#t~mem6 := read~int(~x~0.base, ~x~0.offset, 4); 6#L554-1true assume !!(main_#t~mem6 > 0);havoc main_#t~mem6; 12#L555true assume 0 != main_#t~nondet7;havoc main_#t~nondet7;havoc foo_#res;havoc foo_#t~mem2, foo_#t~post3;call foo_#t~mem2 := read~int(~x~0.base, ~x~0.offset, 4);foo_#t~post3 := foo_#t~mem2;call write~int(foo_#t~post3 - 1, ~x~0.base, ~x~0.offset, 4);havoc foo_#t~post3;havoc foo_#t~mem2; 4#L548true main_#t~ret8 := foo_#res;havoc main_#t~ret8; 5#L555-2true [2019-01-01 21:44:14,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:14,420 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:44:14,422 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:14,423 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:14,476 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,476 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:14,477 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,514 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:14,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:14,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:14,551 INFO L82 PathProgramCache]: Analyzing trace with hash 1144072, now seen corresponding path program 1 times [2019-01-01 21:44:14,551 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:14,551 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:14,553 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,554 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:14,554 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:14,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:14,571 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:14,572 INFO L82 PathProgramCache]: Analyzing trace with hash 889571274, now seen corresponding path program 1 times [2019-01-01 21:44:14,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:44:14,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:44:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,574 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:44:14,574 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:44:14,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:14,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:44:15,175 WARN L181 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 49 DAG size of output: 46 [2019-01-01 21:44:15,309 WARN L181 SmtUtils]: Spent 121.00 ms on a formula simplification that was a NOOP. DAG size: 40 [2019-01-01 21:44:15,341 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:44:15,342 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:44:15,342 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:44:15,343 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:44:15,343 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:44:15,343 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:44:15,343 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:44:15,344 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:44:15,345 INFO L131 ssoRankerPreferences]: Filename of dumped script: HarrisLalNoriRajamani-2010SAS-Fig3-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:44:15,345 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:44:15,345 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:44:15,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,419 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,428 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,453 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,486 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,510 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:15,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-01-01 21:44:16,524 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:44:16,529 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:44:16,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,538 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,550 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,551 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,553 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,555 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,558 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,559 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,559 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,560 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,562 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,564 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,568 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,602 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,606 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,606 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,606 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,611 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,611 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,622 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,622 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,622 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2019-01-01 21:44:16,622 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,623 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-01-01 21:44:16,623 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,633 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,637 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,639 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,648 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,656 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,659 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,659 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,666 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,666 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,676 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,676 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,676 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,676 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,677 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,677 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,682 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:44:16,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,683 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:44:16,683 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:44:16,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,687 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,687 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,688 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,692 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,692 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,713 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,716 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:44:16,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-01-01 21:44:16,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:44:16,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:44:16,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:44:16,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:44:16,725 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:44:16,725 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:44:16,741 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:44:16,753 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-01-01 21:44:16,753 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:44:16,756 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:44:16,759 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:44:16,759 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:44:16,760 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1) = 1*v_rep(select (select #memory_int ~x~0.base) ~x~0.offset)_1 Supporting invariants [] [2019-01-01 21:44:16,784 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2019-01-01 21:44:16,791 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:44:16,827 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:44:16,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:44:16,860 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:44:16,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:44:16,879 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:44:16,965 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:44:16,971 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 33 [2019-01-01 21:44:16,981 INFO L701 Elim1Store]: detected not equals via solver [2019-01-01 21:44:16,983 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 22 [2019-01-01 21:44:16,985 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:44:17,042 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:44:17,049 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:44:17,050 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:32, output treesize:17 [2019-01-01 21:44:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-01-01 21:44:17,097 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2019-01-01 21:44:17,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 11 states. Second operand 5 states. [2019-01-01 21:44:17,213 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 11 states.. Second operand 5 states. Result 24 states and 29 transitions. Complement of second has 9 states. [2019-01-01 21:44:17,214 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-01-01 21:44:17,216 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-01-01 21:44:17,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 18 transitions. [2019-01-01 21:44:17,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 4 letters. [2019-01-01 21:44:17,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:44:17,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 6 letters. Loop has 4 letters. [2019-01-01 21:44:17,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:44:17,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 18 transitions. Stem has 2 letters. Loop has 8 letters. [2019-01-01 21:44:17,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:44:17,225 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 24 states and 29 transitions. [2019-01-01 21:44:17,228 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:44:17,231 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 24 states to 0 states and 0 transitions. [2019-01-01 21:44:17,233 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:44:17,233 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:44:17,234 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:44:17,234 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:44:17,234 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:44:17,235 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:44:17,235 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:44:17,235 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:44:17,235 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:44:17,235 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:44:17,235 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:44:17,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:44:17 BoogieIcfgContainer [2019-01-01 21:44:17,244 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:44:17,244 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:44:17,244 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:44:17,244 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:44:17,245 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:44:14" (3/4) ... [2019-01-01 21:44:17,249 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:44:17,249 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:44:17,250 INFO L168 Benchmark]: Toolchain (without parser) took 4240.95 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 952.7 MB in the beginning and 960.6 MB in the end (delta: -7.9 MB). Peak memory consumption was 138.4 MB. Max. memory is 11.5 GB. [2019-01-01 21:44:17,251 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:44:17,251 INFO L168 Benchmark]: CACSL2BoogieTranslator took 741.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:44:17,253 INFO L168 Benchmark]: Boogie Procedure Inliner took 57.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:44:17,253 INFO L168 Benchmark]: Boogie Preprocessor took 51.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:44:17,254 INFO L168 Benchmark]: RCFGBuilder took 405.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. [2019-01-01 21:44:17,255 INFO L168 Benchmark]: BuchiAutomizer took 2975.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.6 MB in the end (delta: 139.3 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. [2019-01-01 21:44:17,255 INFO L168 Benchmark]: Witness Printer took 4.69 ms. Allocated memory is still 1.2 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:44:17,260 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 978.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 741.54 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 146.3 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -172.1 MB). Peak memory consumption was 25.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 57.09 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 51.40 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 405.13 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.5 MB). Peak memory consumption was 19.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 2975.38 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 960.6 MB in the end (delta: 139.3 MB). Peak memory consumption was 139.3 MB. Max. memory is 11.5 GB. * Witness Printer took 4.69 ms. Allocated memory is still 1.2 GB. Free memory is still 960.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 2.9s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.3s. Construction of modules took 0.0s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 7 SDtfs, 6 SDslu, 15 SDs, 0 SdLazy, 12 SolverSat, 5 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital108 mio100 ax116 hnf100 lsp75 ukn69 mio100 lsp40 div100 bol100 ite100 ukn100 eq144 hnf92 smp91 dnf109 smp100 tf100 neg94 sie123 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 17ms VariablesStem: 1 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 6 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! Received shutdown request...