./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer --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 d098d694ac70f506ee7e05c2de50965e1598d96f ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-10-27 06:06:22,057 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-10-27 06:06:22,058 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-10-27 06:06:22,069 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-10-27 06:06:22,069 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-10-27 06:06:22,070 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-10-27 06:06:22,071 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-10-27 06:06:22,072 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-10-27 06:06:22,074 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-10-27 06:06:22,075 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-10-27 06:06:22,076 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-10-27 06:06:22,076 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-10-27 06:06:22,077 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-10-27 06:06:22,078 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-10-27 06:06:22,079 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-10-27 06:06:22,080 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-10-27 06:06:22,081 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-10-27 06:06:22,082 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-10-27 06:06:22,084 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-10-27 06:06:22,086 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-10-27 06:06:22,087 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-10-27 06:06:22,088 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-10-27 06:06:22,090 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-10-27 06:06:22,091 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-10-27 06:06:22,091 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-10-27 06:06:22,092 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-10-27 06:06:22,092 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-10-27 06:06:22,094 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-10-27 06:06:22,094 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-10-27 06:06:22,095 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-10-27 06:06:22,096 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-10-27 06:06:22,096 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-10-27 06:06:22,096 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-10-27 06:06:22,097 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-10-27 06:06:22,098 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-10-27 06:06:22,099 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-10-27 06:06:22,099 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-10-27 06:06:22,113 INFO L110 SettingsManager]: Loading preferences was successful [2018-10-27 06:06:22,114 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-10-27 06:06:22,115 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-10-27 06:06:22,115 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-10-27 06:06:22,115 INFO L133 SettingsManager]: * Use SBE=true [2018-10-27 06:06:22,115 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-10-27 06:06:22,115 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-10-27 06:06:22,116 INFO L133 SettingsManager]: * Use old map elimination=false [2018-10-27 06:06:22,116 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-10-27 06:06:22,116 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-10-27 06:06:22,116 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-10-27 06:06:22,116 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-10-27 06:06:22,116 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-10-27 06:06:22,117 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-10-27 06:06:22,118 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-10-27 06:06:22,118 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-10-27 06:06:22,119 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-10-27 06:06:22,119 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-10-27 06:06:22,119 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-10-27 06:06:22,119 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-10-27 06:06:22,119 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-10-27 06:06:22,119 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-10-27 06:06:22,120 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-10-27 06:06:22,120 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-10-27 06:06:22,120 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-10-27 06:06:22,120 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-10-27 06:06:22,120 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-10-27 06:06:22,121 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-10-27 06:06:22,121 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer 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 -> d098d694ac70f506ee7e05c2de50965e1598d96f [2018-10-27 06:06:22,154 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-10-27 06:06:22,165 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-10-27 06:06:22,169 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-10-27 06:06:22,170 INFO L271 PluginConnector]: Initializing CDTParser... [2018-10-27 06:06:22,171 INFO L276 PluginConnector]: CDTParser initialized [2018-10-27 06:06:22,172 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:22,226 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/data/665a898ec/0f267c9895e64d0ea1c081fc7d196322/FLAG4af3b860d [2018-10-27 06:06:22,654 INFO L298 CDTParser]: Found 1 translation units. [2018-10-27 06:06:22,655 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/sv-benchmarks/c/termination-memory-alloca/b.07-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:22,678 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/data/665a898ec/0f267c9895e64d0ea1c081fc7d196322/FLAG4af3b860d [2018-10-27 06:06:22,692 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/data/665a898ec/0f267c9895e64d0ea1c081fc7d196322 [2018-10-27 06:06:22,695 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-10-27 06:06:22,696 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-10-27 06:06:22,697 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:22,697 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-10-27 06:06:22,701 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-10-27 06:06:22,702 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:22" (1/1) ... [2018-10-27 06:06:22,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6bd24825 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:22, skipping insertion in model container [2018-10-27 06:06:22,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.10 06:06:22" (1/1) ... [2018-10-27 06:06:22,713 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-10-27 06:06:22,752 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-10-27 06:06:22,995 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:23,005 INFO L189 MainTranslator]: Completed pre-run [2018-10-27 06:06:23,060 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-10-27 06:06:23,115 INFO L193 MainTranslator]: Completed translation [2018-10-27 06:06:23,115 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23 WrapperNode [2018-10-27 06:06:23,115 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-10-27 06:06:23,116 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:23,116 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-10-27 06:06:23,117 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-10-27 06:06:23,126 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,140 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,235 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-10-27 06:06:23,235 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-10-27 06:06:23,236 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-10-27 06:06:23,236 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-10-27 06:06:23,246 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,246 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,250 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,251 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,257 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,262 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,264 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... [2018-10-27 06:06:23,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-10-27 06:06:23,267 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-10-27 06:06:23,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-10-27 06:06:23,268 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-10-27 06:06:23,269 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_92856cbe-f8ce-40a3-867d-6c2c56497ab0/bin-2019/uautomizer/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 [2018-10-27 06:06:23,320 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-10-27 06:06:23,320 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-10-27 06:06:23,321 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-10-27 06:06:23,321 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-10-27 06:06:23,944 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-10-27 06:06:23,944 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:23 BoogieIcfgContainer [2018-10-27 06:06:23,944 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-10-27 06:06:23,945 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-10-27 06:06:23,945 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-10-27 06:06:23,949 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-10-27 06:06:23,950 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:23,950 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 27.10 06:06:22" (1/3) ... [2018-10-27 06:06:23,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2edbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:23, skipping insertion in model container [2018-10-27 06:06:23,952 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:23,952 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.10 06:06:23" (2/3) ... [2018-10-27 06:06:23,952 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a2edbe0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 27.10 06:06:23, skipping insertion in model container [2018-10-27 06:06:23,953 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-10-27 06:06:23,954 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:23" (3/3) ... [2018-10-27 06:06:23,956 INFO L375 chiAutomizerObserver]: Analyzing ICFG b.07-alloca_true-termination_true-no-overflow.c.i [2018-10-27 06:06:24,023 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-10-27 06:06:24,024 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-10-27 06:06:24,024 INFO L375 BuchiCegarLoop]: Hoare is false [2018-10-27 06:06:24,024 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-10-27 06:06:24,025 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-10-27 06:06:24,025 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-10-27 06:06:24,025 INFO L379 BuchiCegarLoop]: Difference is false [2018-10-27 06:06:24,026 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-10-27 06:06:24,026 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-10-27 06:06:24,043 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:06:24,077 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:24,081 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:24,081 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:24,090 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,091 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,091 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-10-27 06:06:24,091 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-10-27 06:06:24,093 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:24,093 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:24,093 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:24,093 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,094 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,105 INFO L793 eck$LassoCheckResult]: Stem: 25#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 10#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 23#L553true SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 26#L553-1true SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 21#L554true SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 7#L555true SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 17#L557-10true [2018-10-27 06:06:24,106 INFO L795 eck$LassoCheckResult]: Loop: 17#L557-10true assume true; 4#L557true SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 6#L557-1true SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 8#L557-2true test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 9#L557-3true assume !test_fun_#t~short10; 29#L557-8true assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 16#L558true SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 18#L558-1true SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 20#L558-2true havoc test_fun_#t~mem11; 15#L559true SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 3#L559-1true SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 5#L559-2true havoc test_fun_#t~mem12; 17#L557-10true [2018-10-27 06:06:24,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,119 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 1 times [2018-10-27 06:06:24,121 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,122 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,184 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:24,185 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,353 INFO L82 PathProgramCache]: Analyzing trace with hash -1554062579, now seen corresponding path program 1 times [2018-10-27 06:06:24,353 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,353 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,356 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:24,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:24,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:24,422 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-10-27 06:06:24,423 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-10-27 06:06:24,427 INFO L810 eck$LassoCheckResult]: loop already infeasible [2018-10-27 06:06:24,444 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-10-27 06:06:24,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-10-27 06:06:24,448 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 3 states. [2018-10-27 06:06:24,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-10-27 06:06:24,520 INFO L93 Difference]: Finished difference Result 28 states and 29 transitions. [2018-10-27 06:06:24,520 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-10-27 06:06:24,522 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 29 transitions. [2018-10-27 06:06:24,524 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:24,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 21 states and 21 transitions. [2018-10-27 06:06:24,530 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 21 [2018-10-27 06:06:24,530 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 21 [2018-10-27 06:06:24,531 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 21 transitions. [2018-10-27 06:06:24,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:24,531 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-27 06:06:24,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 21 transitions. [2018-10-27 06:06:24,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-10-27 06:06:24,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-10-27 06:06:24,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-10-27 06:06:24,566 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-27 06:06:24,566 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-10-27 06:06:24,566 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-10-27 06:06:24,566 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 21 transitions. [2018-10-27 06:06:24,567 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 15 [2018-10-27 06:06:24,567 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-10-27 06:06:24,567 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-10-27 06:06:24,568 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,568 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-10-27 06:06:24,568 INFO L793 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 78#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet14, main_#t~nondet15, main_#t~nondet16, main_#t~ret17;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet14, main_#t~nondet15, main_#t~nondet16;havoc test_fun_#res;havoc test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset, test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset, test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset, test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~mem9, test_fun_#t~short10, test_fun_#t~mem13, test_fun_~x, test_fun_~y, test_fun_~z, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, test_fun_~c~0.base, test_fun_~c~0.offset;test_fun_~x := test_fun_#in~x;test_fun_~y := test_fun_#in~y;test_fun_~z := test_fun_#in~z;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset; 79#L553 SUMMARY for call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L553 80#L553-1 SUMMARY for call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L553-1 76#L554 SUMMARY for call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L554 74#L555 SUMMARY for call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); srcloc: L555 68#L557-10 [2018-10-27 06:06:24,568 INFO L795 eck$LassoCheckResult]: Loop: 68#L557-10 assume true; 69#L557 SUMMARY for call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L557 70#L557-1 SUMMARY for call test_fun_#t~mem7 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-1 72#L557-2 test_fun_#t~short10 := test_fun_#t~mem6 > test_fun_#t~mem7; 75#L557-3 assume test_fun_#t~short10; 77#L557-4 SUMMARY for call test_fun_#t~mem8 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L557-4 81#L557-5 SUMMARY for call test_fun_#t~mem9 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); srcloc: L557-5 83#L557-6 test_fun_#t~short10 := test_fun_#t~mem8 > test_fun_#t~mem9; 84#L557-8 assume !!test_fun_#t~short10;havoc test_fun_#t~mem9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem6;havoc test_fun_#t~mem7;havoc test_fun_#t~short10; 64#L558 SUMMARY for call test_fun_#t~mem11 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558 65#L558-1 SUMMARY for call write~int(test_fun_#t~mem11 - 1, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4); srcloc: L558-1 71#L558-2 havoc test_fun_#t~mem11; 73#L559 SUMMARY for call test_fun_#t~mem12 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559 66#L559-1 SUMMARY for call write~int(test_fun_#t~mem12 - 1, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4); srcloc: L559-1 67#L559-2 havoc test_fun_#t~mem12; 68#L557-10 [2018-10-27 06:06:24,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,575 INFO L82 PathProgramCache]: Analyzing trace with hash 889444101, now seen corresponding path program 2 times [2018-10-27 06:06:24,575 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,577 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:24,577 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,625 INFO L82 PathProgramCache]: Analyzing trace with hash -1370635495, now seen corresponding path program 1 times [2018-10-27 06:06:24,625 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,625 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,627 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-10-27 06:06:24,627 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,660 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:24,660 INFO L82 PathProgramCache]: Analyzing trace with hash 2055766933, now seen corresponding path program 1 times [2018-10-27 06:06:24,660 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-10-27 06:06:24,660 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-10-27 06:06:24,662 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-10-27 06:06:24,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-10-27 06:06:24,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:24,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-10-27 06:06:25,304 WARN L179 SmtUtils]: Spent 559.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 66 [2018-10-27 06:06:25,517 WARN L179 SmtUtils]: Spent 177.00 ms on a formula simplification that was a NOOP. DAG size: 50 [2018-10-27 06:06:26,527 WARN L179 SmtUtils]: Spent 1.01 s on a formula simplification. DAG size of input: 139 DAG size of output: 121 [2018-10-27 06:06:26,703 WARN L179 SmtUtils]: Spent 174.00 ms on a formula simplification that was a NOOP. DAG size: 113 [2018-10-27 06:06:26,716 INFO L214 LassoAnalysis]: Preferences: [2018-10-27 06:06:26,717 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-10-27 06:06:26,717 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-10-27 06:06:26,717 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-10-27 06:06:26,718 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-10-27 06:06:26,718 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-10-27 06:06:26,719 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-10-27 06:06:26,719 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-10-27 06:06:26,720 INFO L131 ssoRankerPreferences]: Filename of dumped script: b.07-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-10-27 06:06:26,720 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-10-27 06:06:26,720 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-10-27 06:06:26,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:26,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,765 WARN L179 SmtUtils]: Spent 704.00 ms on a formula simplification. DAG size of input: 147 DAG size of output: 127 [2018-10-27 06:06:27,937 WARN L179 SmtUtils]: Spent 162.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 83 [2018-10-27 06:06:27,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,946 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,949 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:27,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-10-27 06:06:28,127 WARN L179 SmtUtils]: Spent 126.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 59 [2018-10-27 06:06:28,719 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-10-27 06:06:28,724 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-10-27 06:06:28,726 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 [2018-10-27 06:06:28,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:28,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,729 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:28,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:28,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,735 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 [2018-10-27 06:06:28,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:28,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,737 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:28,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:28,740 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,740 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 [2018-10-27 06:06:28,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,741 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,750 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,751 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 [2018-10-27 06:06:28,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:28,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,752 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:28,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:28,756 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,757 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 [2018-10-27 06:06:28,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:28,758 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,758 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,758 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:28,759 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:28,760 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,760 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 [2018-10-27 06:06:28,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-10-27 06:06:28,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,765 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-10-27 06:06:28,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-10-27 06:06:28,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,767 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 [2018-10-27 06:06:28,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,773 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,773 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,778 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,778 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 [2018-10-27 06:06:28,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,788 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,788 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 [2018-10-27 06:06:28,789 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,791 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,791 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,791 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,792 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,793 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,795 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,796 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 [2018-10-27 06:06:28,796 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,796 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,798 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,800 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,800 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,803 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,804 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 [2018-10-27 06:06:28,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,807 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,819 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,819 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,880 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-10-27 06:06:28,881 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 [2018-10-27 06:06:28,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-10-27 06:06:28,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-10-27 06:06:28,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-10-27 06:06:28,883 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-10-27 06:06:28,888 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-10-27 06:06:28,888 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-10-27 06:06:28,923 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-10-27 06:06:28,984 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-10-27 06:06:28,985 INFO L444 ModelExtractionUtils]: 30 out of 40 variables were initially zero. Simplification set additionally 7 variables to zero. [2018-10-27 06:06:28,987 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-10-27 06:06:28,989 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-10-27 06:06:28,989 INFO L517 LassoAnalysis]: Proved termination. [2018-10-27 06:06:28,990 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~y_ref~0.base) ULTIMATE.start_test_fun_~y_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_1 Supporting invariants [] [2018-10-27 06:06:29,254 INFO L297 tatePredicateManager]: 37 out of 37 supporting invariants were superfluous and have been removed [2018-10-27 06:06:29,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:29,276 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-10-27 06:06:29,330 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-10-27 06:06:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:29,376 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:29,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-10-27 06:06:29,404 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-10-27 06:06:29,751 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:29,785 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 60 treesize of output 85 [2018-10-27 06:06:29,834 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:29,913 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:29,938 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:29,950 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:29,952 INFO L303 Elim1Store]: Index analysis took 153 ms [2018-10-27 06:06:29,963 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 57 treesize of output 95 [2018-10-27 06:06:29,969 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-10-27 06:06:30,454 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:30,465 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 56 treesize of output 72 [2018-10-27 06:06:30,468 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-10-27 06:06:30,645 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:30,646 INFO L477 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 61 treesize of output 62 [2018-10-27 06:06:30,647 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:30,804 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:30,806 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:30,808 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:30,809 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 73 [2018-10-27 06:06:30,810 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:30,884 INFO L267 ElimStorePlain]: Start of recursive call 2: 4 dim-1 vars, End of recursive call: and 6 xjuncts. [2018-10-27 06:06:30,954 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 5 xjuncts. [2018-10-27 06:06:30,954 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:60, output treesize:138 [2018-10-27 06:06:31,170 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,182 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 59 [2018-10-27 06:06:31,200 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,201 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 52 [2018-10-27 06:06:31,205 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,268 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,269 INFO L477 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 42 treesize of output 41 [2018-10-27 06:06:31,270 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,292 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-10-27 06:06:31,340 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,341 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 45 [2018-10-27 06:06:31,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 34 [2018-10-27 06:06:31,348 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,385 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,452 INFO L700 Elim1Store]: detected not equals via solver [2018-10-27 06:06:31,454 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 44 [2018-10-27 06:06:31,470 INFO L477 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 37 treesize of output 30 [2018-10-27 06:06:31,470 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,477 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-10-27 06:06:31,512 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 4 xjuncts. [2018-10-27 06:06:31,512 INFO L202 ElimStorePlain]: Needed 8 recursive calls to eliminate 6 variables, input treesize:137, output treesize:99 [2018-10-27 06:06:31,576 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-10-27 06:06:31,578 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 13 loop predicates [2018-10-27 06:06:31,579 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1 Second operand 15 states. [2018-10-27 06:06:32,047 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 21 transitions. cyclomatic complexity: 1. Second operand 15 states. Result 37 states and 38 transitions. Complement of second has 26 states. [2018-10-27 06:06:32,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 1 stem states 12 non-accepting loop states 1 accepting loop states [2018-10-27 06:06:32,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-10-27 06:06:32,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 22 transitions. [2018-10-27 06:06:32,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 6 letters. Loop has 15 letters. [2018-10-27 06:06:32,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:32,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 21 letters. Loop has 15 letters. [2018-10-27 06:06:32,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:32,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 22 transitions. Stem has 6 letters. Loop has 30 letters. [2018-10-27 06:06:32,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-10-27 06:06:32,057 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 37 states and 38 transitions. [2018-10-27 06:06:32,059 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:32,059 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 37 states to 0 states and 0 transitions. [2018-10-27 06:06:32,059 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-10-27 06:06:32,059 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-10-27 06:06:32,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-10-27 06:06:32,059 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-10-27 06:06:32,059 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:32,059 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:32,059 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-10-27 06:06:32,060 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-10-27 06:06:32,060 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-10-27 06:06:32,060 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-10-27 06:06:32,060 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-10-27 06:06:32,071 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 27.10 06:06:32 BoogieIcfgContainer [2018-10-27 06:06:32,071 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-10-27 06:06:32,072 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-10-27 06:06:32,072 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-10-27 06:06:32,072 INFO L276 PluginConnector]: Witness Printer initialized [2018-10-27 06:06:32,072 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.10 06:06:23" (3/4) ... [2018-10-27 06:06:32,078 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-10-27 06:06:32,078 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-10-27 06:06:32,079 INFO L168 Benchmark]: Toolchain (without parser) took 9383.73 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 295.2 MB). Free memory was 957.0 MB in the beginning and 1.1 GB in the end (delta: -94.0 MB). Peak memory consumption was 201.1 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,080 INFO L168 Benchmark]: CDTParser took 0.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:32,080 INFO L168 Benchmark]: CACSL2BoogieTranslator took 419.15 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,080 INFO L168 Benchmark]: Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -241.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,083 INFO L168 Benchmark]: Boogie Preprocessor took 31.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,083 INFO L168 Benchmark]: RCFGBuilder took 677.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,084 INFO L168 Benchmark]: BuchiAutomizer took 8126.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 97.1 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. [2018-10-27 06:06:32,084 INFO L168 Benchmark]: Witness Printer took 6.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-10-27 06:06:32,088 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.18 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 419.15 ms. Allocated memory is still 1.0 GB. Free memory was 957.0 MB in the beginning and 935.5 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 118.93 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 186.1 MB). Free memory was 935.5 MB in the beginning and 1.2 GB in the end (delta: -241.6 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.55 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 677.08 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 25.6 MB). Peak memory consumption was 25.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8126.32 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 109.1 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 97.1 MB). Peak memory consumption was 206.2 MB. Max. memory is 11.5 GB. * Witness Printer took 6.48 ms. Allocated memory is still 1.3 GB. Free memory is still 1.1 GB. 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 - 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 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[y_ref][y_ref] + -1 * unknown-#memory_int-unknown[z_ref][z_ref] and consists of 14 locations. 1 modules have a trivial ranking function, the largest among these consists of 3 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.0s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 5.0s. Construction of modules took 0.1s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 21 states and ocurred in iteration 1. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 36 SDtfs, 26 SDslu, 39 SDs, 0 SdLazy, 72 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital427 mio100 ax104 hnf100 lsp93 ukn68 mio100 lsp38 div100 bol100 ite100 ukn100 eq199 hnf87 smp96 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms 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...