./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/termination-memory-alloca/easySum-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/easySum-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 76734cd11c33a85b413392e9940357c680656079 ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ 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:49:32,245 INFO L170 SettingsManager]: Resetting all preferences to default values... [2019-01-01 21:49:32,247 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2019-01-01 21:49:32,259 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-01-01 21:49:32,260 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-01-01 21:49:32,261 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-01-01 21:49:32,262 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-01-01 21:49:32,264 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2019-01-01 21:49:32,266 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-01-01 21:49:32,267 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-01-01 21:49:32,267 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-01-01 21:49:32,268 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-01-01 21:49:32,269 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-01-01 21:49:32,270 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-01-01 21:49:32,271 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-01-01 21:49:32,272 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-01-01 21:49:32,272 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-01-01 21:49:32,274 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-01-01 21:49:32,276 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2019-01-01 21:49:32,278 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-01-01 21:49:32,280 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-01-01 21:49:32,281 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-01-01 21:49:32,284 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-01-01 21:49:32,284 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-01-01 21:49:32,284 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-01-01 21:49:32,285 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-01-01 21:49:32,286 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-01-01 21:49:32,287 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-01-01 21:49:32,288 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2019-01-01 21:49:32,289 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-01-01 21:49:32,290 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2019-01-01 21:49:32,290 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-01-01 21:49:32,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-01-01 21:49:32,291 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2019-01-01 21:49:32,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2019-01-01 21:49:32,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2019-01-01 21:49:32,293 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:49:32,311 INFO L110 SettingsManager]: Loading preferences was successful [2019-01-01 21:49:32,312 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2019-01-01 21:49:32,313 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-01-01 21:49:32,313 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2019-01-01 21:49:32,313 INFO L133 SettingsManager]: * Use SBE=true [2019-01-01 21:49:32,314 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-01-01 21:49:32,314 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-01-01 21:49:32,314 INFO L133 SettingsManager]: * Use old map elimination=false [2019-01-01 21:49:32,314 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2019-01-01 21:49:32,314 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2019-01-01 21:49:32,315 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-01-01 21:49:32,315 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-01-01 21:49:32,315 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-01-01 21:49:32,315 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2019-01-01 21:49:32,315 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2019-01-01 21:49:32,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-01-01 21:49:32,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-01-01 21:49:32,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-01-01 21:49:32,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2019-01-01 21:49:32,320 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-01-01 21:49:32,320 INFO L133 SettingsManager]: * Use constant arrays=true [2019-01-01 21:49:32,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-01-01 21:49:32,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-01-01 21:49:32,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-01-01 21:49:32,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-01-01 21:49:32,322 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-01-01 21:49:32,322 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2019-01-01 21:49:32,322 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-01-01 21:49:32,323 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-01-01 21:49:32,323 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 -> 76734cd11c33a85b413392e9940357c680656079 [2019-01-01 21:49:32,387 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-01-01 21:49:32,405 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-01-01 21:49:32,411 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-01-01 21:49:32,413 INFO L271 PluginConnector]: Initializing CDTParser... [2019-01-01 21:49:32,413 INFO L276 PluginConnector]: CDTParser initialized [2019-01-01 21:49:32,415 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/termination-memory-alloca/easySum-alloca_true-termination.c.i [2019-01-01 21:49:32,478 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0574f86f8/1fadb3bbaed34f41b56285f3d6cd0edf/FLAGe52cdcfcb [2019-01-01 21:49:32,950 INFO L307 CDTParser]: Found 1 translation units. [2019-01-01 21:49:32,951 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/termination-memory-alloca/easySum-alloca_true-termination.c.i [2019-01-01 21:49:32,966 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0574f86f8/1fadb3bbaed34f41b56285f3d6cd0edf/FLAGe52cdcfcb [2019-01-01 21:49:33,250 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0574f86f8/1fadb3bbaed34f41b56285f3d6cd0edf [2019-01-01 21:49:33,254 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-01-01 21:49:33,255 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-01-01 21:49:33,256 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:33,256 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-01-01 21:49:33,260 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2019-01-01 21:49:33,261 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,264 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4100c53d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33, skipping insertion in model container [2019-01-01 21:49:33,264 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,272 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-01-01 21:49:33,321 INFO L176 MainTranslator]: Built tables and reachable declarations [2019-01-01 21:49:33,709 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:33,727 INFO L191 MainTranslator]: Completed pre-run [2019-01-01 21:49:33,858 INFO L204 PostProcessor]: Analyzing one entry point: main [2019-01-01 21:49:33,918 INFO L195 MainTranslator]: Completed translation [2019-01-01 21:49:33,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33 WrapperNode [2019-01-01 21:49:33,919 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-01-01 21:49:33,921 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:33,921 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-01-01 21:49:33,921 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2019-01-01 21:49:33,931 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:49:33" (1/1) ... [2019-01-01 21:49:33,949 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:49:33" (1/1) ... [2019-01-01 21:49:33,973 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-01-01 21:49:33,974 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-01-01 21:49:33,974 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-01-01 21:49:33,974 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2019-01-01 21:49:33,985 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,985 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,990 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,990 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:33,996 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:34,001 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:34,002 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (1/1) ... [2019-01-01 21:49:34,005 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-01-01 21:49:34,005 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-01-01 21:49:34,005 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-01-01 21:49:34,006 INFO L276 PluginConnector]: RCFGBuilder initialized [2019-01-01 21:49:34,007 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (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:49:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-01-01 21:49:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-01-01 21:49:34,068 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-01-01 21:49:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-01-01 21:49:34,069 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-01-01 21:49:34,069 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-01-01 21:49:34,369 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-01-01 21:49:34,369 INFO L280 CfgBuilder]: Removed 7 assue(true) statements. [2019-01-01 21:49:34,370 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:34 BoogieIcfgContainer [2019-01-01 21:49:34,370 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-01-01 21:49:34,371 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-01-01 21:49:34,371 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-01-01 21:49:34,378 INFO L276 PluginConnector]: BuchiAutomizer initialized [2019-01-01 21:49:34,380 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:34,380 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 01.01 09:49:33" (1/3) ... [2019-01-01 21:49:34,382 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11189079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:34, skipping insertion in model container [2019-01-01 21:49:34,382 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:34,382 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.01 09:49:33" (2/3) ... [2019-01-01 21:49:34,383 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11189079 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 01.01 09:49:34, skipping insertion in model container [2019-01-01 21:49:34,383 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-01-01 21:49:34,383 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:34" (3/3) ... [2019-01-01 21:49:34,385 INFO L375 chiAutomizerObserver]: Analyzing ICFG easySum-alloca_true-termination.c.i [2019-01-01 21:49:34,500 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2019-01-01 21:49:34,501 INFO L374 BuchiCegarLoop]: Interprodecural is true [2019-01-01 21:49:34,501 INFO L375 BuchiCegarLoop]: Hoare is false [2019-01-01 21:49:34,502 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-01-01 21:49:34,502 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-01-01 21:49:34,502 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-01-01 21:49:34,502 INFO L379 BuchiCegarLoop]: Difference is false [2019-01-01 21:49:34,503 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-01-01 21:49:34,503 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-01-01 21:49:34,518 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:49:34,540 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:34,540 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:34,541 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:34,549 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:49:34,549 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:34,549 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2019-01-01 21:49:34,549 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 10 states. [2019-01-01 21:49:34,550 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2019-01-01 21:49:34,551 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-01-01 21:49:34,551 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-01-01 21:49:34,551 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-01-01 21:49:34,551 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2019-01-01 21:49:34,560 INFO L794 eck$LassoCheckResult]: Stem: 5#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true havoc main_#res;havoc main_#t~nondet12, main_#t~ret13;iterate_#in~bound := main_#t~nondet12;havoc iterate_#res;havoc iterate_#t~malloc2.base, iterate_#t~malloc2.offset, iterate_#t~malloc3.base, iterate_#t~malloc3.offset, iterate_#t~malloc4.base, iterate_#t~malloc4.offset, iterate_#t~mem9, iterate_#t~mem10, iterate_#t~mem5, iterate_#t~post6, iterate_#t~mem7, iterate_#t~mem8, iterate_#t~mem11, iterate_~bound, iterate_~bound_ref~0.base, iterate_~bound_ref~0.offset, iterate_~i~0.base, iterate_~i~0.offset, iterate_~sum~0.base, iterate_~sum~0.offset;iterate_~bound := iterate_#in~bound;call iterate_#t~malloc2.base, iterate_#t~malloc2.offset := #Ultimate.allocOnStack(4);iterate_~bound_ref~0.base, iterate_~bound_ref~0.offset := iterate_#t~malloc2.base, iterate_#t~malloc2.offset;call iterate_#t~malloc3.base, iterate_#t~malloc3.offset := #Ultimate.allocOnStack(4);iterate_~i~0.base, iterate_~i~0.offset := iterate_#t~malloc3.base, iterate_#t~malloc3.offset;call iterate_#t~malloc4.base, iterate_#t~malloc4.offset := #Ultimate.allocOnStack(4);iterate_~sum~0.base, iterate_~sum~0.offset := iterate_#t~malloc4.base, iterate_#t~malloc4.offset;call write~int(iterate_~bound, iterate_~bound_ref~0.base, iterate_~bound_ref~0.offset, 4);call write~int(0, iterate_~sum~0.base, iterate_~sum~0.offset, 4);call write~int(0, iterate_~i~0.base, iterate_~i~0.offset, 4); 9#L554-4true [2019-01-01 21:49:34,560 INFO L796 eck$LassoCheckResult]: Loop: 9#L554-4true call iterate_#t~mem7 := read~int(iterate_~i~0.base, iterate_~i~0.offset, 4);call iterate_#t~mem8 := read~int(iterate_~bound_ref~0.base, iterate_~bound_ref~0.offset, 4); 4#L554-1true assume !!(iterate_#t~mem7 < iterate_#t~mem8);havoc iterate_#t~mem8;havoc iterate_#t~mem7;call iterate_#t~mem9 := read~int(iterate_~sum~0.base, iterate_~sum~0.offset, 4);call iterate_#t~mem10 := read~int(iterate_~i~0.base, iterate_~i~0.offset, 4);call write~int(iterate_#t~mem9 + iterate_#t~mem10, iterate_~sum~0.base, iterate_~sum~0.offset, 4);havoc iterate_#t~mem9;havoc iterate_#t~mem10; 7#L554-3true call iterate_#t~mem5 := read~int(iterate_~i~0.base, iterate_~i~0.offset, 4);iterate_#t~post6 := iterate_#t~mem5;call write~int(1 + iterate_#t~post6, iterate_~i~0.base, iterate_~i~0.offset, 4);havoc iterate_#t~post6;havoc iterate_#t~mem5; 9#L554-4true [2019-01-01 21:49:34,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:34,569 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-01-01 21:49:34,572 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:34,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:34,634 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,635 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:34,635 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:34,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:34,787 INFO L82 PathProgramCache]: Analyzing trace with hash 35911, now seen corresponding path program 1 times [2019-01-01 21:49:34,787 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:34,787 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:34,790 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,790 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:34,791 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:34,846 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:34,847 INFO L82 PathProgramCache]: Analyzing trace with hash 28694853, now seen corresponding path program 1 times [2019-01-01 21:49:34,847 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2019-01-01 21:49:34,847 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2019-01-01 21:49:34,849 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,849 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-01-01 21:49:34,850 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2019-01-01 21:49:34,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:34,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-01-01 21:49:35,341 WARN L181 SmtUtils]: Spent 370.00 ms on a formula simplification that was a NOOP. DAG size: 54 [2019-01-01 21:49:35,506 WARN L181 SmtUtils]: Spent 154.00 ms on a formula simplification that was a NOOP. DAG size: 48 [2019-01-01 21:49:36,338 WARN L181 SmtUtils]: Spent 828.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 86 [2019-01-01 21:49:36,647 WARN L181 SmtUtils]: Spent 306.00 ms on a formula simplification that was a NOOP. DAG size: 84 [2019-01-01 21:49:36,675 INFO L216 LassoAnalysis]: Preferences: [2019-01-01 21:49:36,676 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-01-01 21:49:36,677 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-01-01 21:49:36,677 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-01-01 21:49:36,677 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-01-01 21:49:36,677 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-01-01 21:49:36,677 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-01-01 21:49:36,678 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-01-01 21:49:36,679 INFO L131 ssoRankerPreferences]: Filename of dumped script: easySum-alloca_true-termination.c.i_Iteration1_Lasso [2019-01-01 21:49:36,679 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-01-01 21:49:36,679 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2019-01-01 21:49:36,724 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:49:36,754 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:49:36,781 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:49:36,809 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:49:36,849 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:49:36,888 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:49:36,915 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:49:36,939 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:49:36,957 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:49:36,966 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:49:36,972 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:49:37,616 WARN L181 SmtUtils]: Spent 481.00 ms on a formula simplification. DAG size of input: 83 DAG size of output: 70 [2019-01-01 21:49:37,813 WARN L181 SmtUtils]: Spent 186.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 58 [2019-01-01 21:49:37,814 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:49:37,823 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:49:37,863 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:49:37,892 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:49:37,899 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:49:37,903 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:49:37,908 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:49:39,179 WARN L181 SmtUtils]: Spent 603.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-01-01 21:49:39,309 INFO L300 LassoAnalysis]: Preprocessing complete. [2019-01-01 21:49:39,316 INFO L497 LassoAnalysis]: Using template 'affine'. [2019-01-01 21:49:39,318 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:49:39,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:39,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,322 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,324 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:39,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:39,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,328 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:49:39,328 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:39,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,330 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:39,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:39,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,331 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:49:39,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:39,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:39,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:39,334 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,334 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:49:39,335 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,335 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,335 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,335 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,338 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,339 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,343 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:49:39,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,346 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,346 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,350 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:49:39,351 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:39,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,351 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:39,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:39,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,354 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:49:39,354 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,363 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:49:39,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,376 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:49:39,377 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,383 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:49:39,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,384 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-01-01 21:49:39,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,385 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-01-01 21:49:39,385 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-01-01 21:49:39,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,386 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:49:39,387 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,387 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,390 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,391 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-01-01 21:49:39,404 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:49:39,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2019-01-01 21:49:39,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2019-01-01 21:49:39,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2019-01-01 21:49:39,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2019-01-01 21:49:39,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-01-01 21:49:39,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-01-01 21:49:39,451 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-01-01 21:49:39,482 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-01-01 21:49:39,482 INFO L444 ModelExtractionUtils]: 18 out of 22 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-01-01 21:49:39,490 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-01-01 21:49:39,491 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-01-01 21:49:39,493 INFO L518 LassoAnalysis]: Proved termination. [2019-01-01 21:49:39,494 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1, v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1) = 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~bound_ref~0.base) ULTIMATE.start_iterate_~bound_ref~0.offset)_1 - 1*v_rep(select (select #memory_int ULTIMATE.start_iterate_~i~0.base) ULTIMATE.start_iterate_~i~0.offset)_1 Supporting invariants [] [2019-01-01 21:49:39,789 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2019-01-01 21:49:39,802 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:49:39,803 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-01-01 21:49:39,835 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-01-01 21:49:39,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:39,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:39,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-01-01 21:49:39,908 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2019-01-01 21:49:40,016 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 51 [2019-01-01 21:49:40,024 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2019-01-01 21:49:40,025 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-01-01 21:49:40,035 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:40,052 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-01-01 21:49:40,053 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:59, output treesize:38 [2019-01-01 21:49:40,107 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:49:40,124 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-01-01 21:49:40,126 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 10 states. Second operand 4 states. [2019-01-01 21:49:40,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 10 states.. Second operand 4 states. Result 19 states and 21 transitions. Complement of second has 10 states. [2019-01-01 21:49:40,288 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:49:40,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-01-01 21:49:40,290 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 11 transitions. [2019-01-01 21:49:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 3 letters. [2019-01-01 21:49:40,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:40,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 5 letters. Loop has 3 letters. [2019-01-01 21:49:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:40,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 11 transitions. Stem has 2 letters. Loop has 6 letters. [2019-01-01 21:49:40,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-01-01 21:49:40,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 19 states and 21 transitions. [2019-01-01 21:49:40,296 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:40,298 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 19 states to 0 states and 0 transitions. [2019-01-01 21:49:40,299 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-01-01 21:49:40,299 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-01-01 21:49:40,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-01-01 21:49:40,300 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-01-01 21:49:40,300 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:40,300 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:40,300 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-01-01 21:49:40,300 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2019-01-01 21:49:40,301 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-01-01 21:49:40,301 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-01-01 21:49:40,301 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-01-01 21:49:40,308 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 01.01 09:49:40 BoogieIcfgContainer [2019-01-01 21:49:40,308 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-01-01 21:49:40,308 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-01-01 21:49:40,309 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-01-01 21:49:40,309 INFO L276 PluginConnector]: Witness Printer initialized [2019-01-01 21:49:40,309 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.01 09:49:34" (3/4) ... [2019-01-01 21:49:40,313 INFO L147 WitnessPrinter]: No result that supports witness generation found [2019-01-01 21:49:40,313 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-01-01 21:49:40,314 INFO L168 Benchmark]: Toolchain (without parser) took 7059.73 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 191.9 MB). Free memory was 952.7 MB in the beginning and 1.1 GB in the end (delta: -127.7 MB). Peak memory consumption was 64.2 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:40,315 INFO L168 Benchmark]: CDTParser took 0.23 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:49:40,316 INFO L168 Benchmark]: CACSL2BoogieTranslator took 663.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:40,317 INFO L168 Benchmark]: Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:40,317 INFO L168 Benchmark]: Boogie Preprocessor took 31.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-01-01 21:49:40,324 INFO L168 Benchmark]: RCFGBuilder took 365.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:40,325 INFO L168 Benchmark]: BuchiAutomizer took 5937.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -237.8 kB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. [2019-01-01 21:49:40,326 INFO L168 Benchmark]: Witness Printer took 4.65 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:49:40,332 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.23 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 663.51 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 120.1 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -151.9 MB). Peak memory consumption was 25.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 52.74 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 31.30 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 365.12 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.1 MB). Peak memory consumption was 19.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 5937.03 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 71.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -237.8 kB). Peak memory consumption was 71.6 MB. Max. memory is 11.5 GB. * Witness Printer took 4.65 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. * 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 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[bound_ref][bound_ref] + -1 * unknown-#memory_int-unknown[i][i] and consists of 6 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 5.8s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 5.2s. Construction of modules took 0.0s. Büchi inclusion checks took 0.4s. 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: 2 SDtfs, 1 SDslu, 0 SDs, 0 SdLazy, 16 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital329 mio100 ax105 hnf100 lsp91 ukn56 mio100 lsp39 div100 bol100 ite100 ukn100 eq179 hnf88 smp91 dnf330 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 8ms 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...