./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/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 4eacdd25ec766896c06b3ec61ff2eab4c80478ff ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 12:21:10,670 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 12:21:10,671 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 12:21:10,677 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 12:21:10,677 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 12:21:10,678 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 12:21:10,679 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 12:21:10,680 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 12:21:10,681 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 12:21:10,681 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 12:21:10,682 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 12:21:10,682 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 12:21:10,683 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 12:21:10,683 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 12:21:10,684 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 12:21:10,685 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 12:21:10,685 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 12:21:10,686 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 12:21:10,688 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 12:21:10,689 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 12:21:10,690 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 12:21:10,690 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 12:21:10,692 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 12:21:10,692 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 12:21:10,692 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 12:21:10,693 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 12:21:10,694 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 12:21:10,694 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 12:21:10,695 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 12:21:10,695 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 12:21:10,696 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 12:21:10,696 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 12:21:10,696 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 12:21:10,696 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 12:21:10,697 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 12:21:10,698 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 12:21:10,698 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 12:21:10,709 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 12:21:10,709 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 12:21:10,710 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 12:21:10,710 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 12:21:10,710 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 12:21:10,710 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 12:21:10,710 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 12:21:10,711 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 12:21:10,711 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 12:21:10,712 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 12:21:10,713 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 12:21:10,713 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 12:21:10,713 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 12:21:10,713 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 12:21:10,713 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 12:21:10,713 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 12:21:10,713 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 12:21:10,714 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 12:21:10,714 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_94900596-2246-4a18-897a-f88c738a6670/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 -> 4eacdd25ec766896c06b3ec61ff2eab4c80478ff [2018-11-18 12:21:10,738 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 12:21:10,746 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 12:21:10,748 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 12:21:10,749 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 12:21:10,749 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 12:21:10,750 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:21:10,787 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/data/afd79f868/78dd4419c9f74569ab4e0fbfb4ea8b16/FLAG4384a3548 [2018-11-18 12:21:11,203 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 12:21:11,203 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/sv-benchmarks/c/termination-memory-alloca/c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:21:11,210 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/data/afd79f868/78dd4419c9f74569ab4e0fbfb4ea8b16/FLAG4384a3548 [2018-11-18 12:21:11,221 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/bin-2019/uautomizer/data/afd79f868/78dd4419c9f74569ab4e0fbfb4ea8b16 [2018-11-18 12:21:11,223 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 12:21:11,224 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 12:21:11,224 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:11,224 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 12:21:11,226 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 12:21:11,227 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,228 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@c938308 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11, skipping insertion in model container [2018-11-18 12:21:11,229 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,234 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 12:21:11,260 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 12:21:11,436 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:11,445 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 12:21:11,469 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 12:21:11,543 INFO L195 MainTranslator]: Completed translation [2018-11-18 12:21:11,543 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11 WrapperNode [2018-11-18 12:21:11,543 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 12:21:11,544 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:11,544 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 12:21:11,544 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 12:21:11,551 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,560 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,572 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 12:21:11,573 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 12:21:11,573 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 12:21:11,573 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 12:21:11,579 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,579 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,581 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,581 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,584 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,588 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... [2018-11-18 12:21:11,590 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 12:21:11,591 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 12:21:11,591 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 12:21:11,591 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 12:21:11,592 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_94900596-2246-4a18-897a-f88c738a6670/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-11-18 12:21:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 12:21:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 12:21:11,637 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 12:21:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 12:21:11,638 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 12:21:11,638 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 12:21:11,840 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 12:21:11,840 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:11 BoogieIcfgContainer [2018-11-18 12:21:11,840 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 12:21:11,841 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 12:21:11,841 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 12:21:11,844 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 12:21:11,844 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:11,845 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 12:21:11" (1/3) ... [2018-11-18 12:21:11,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a5f9e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:21:11, skipping insertion in model container [2018-11-18 12:21:11,846 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:11,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 12:21:11" (2/3) ... [2018-11-18 12:21:11,846 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4a5f9e07 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 12:21:11, skipping insertion in model container [2018-11-18 12:21:11,846 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 12:21:11,846 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:11" (3/3) ... [2018-11-18 12:21:11,848 INFO L375 chiAutomizerObserver]: Analyzing ICFG c.03-alloca_true-termination_true-no-overflow.c.i [2018-11-18 12:21:11,896 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 12:21:11,897 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 12:21:11,897 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 12:21:11,897 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 12:21:11,897 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 12:21:11,897 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 12:21:11,897 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 12:21:11,897 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 12:21:11,898 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 12:21:11,910 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 12:21:11,928 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:21:11,928 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:11,928 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:11,934 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:21:11,934 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:21:11,934 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 12:21:11,934 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states. [2018-11-18 12:21:11,935 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:21:11,935 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:11,935 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:11,936 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 12:21:11,936 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:21:11,942 INFO L794 eck$LassoCheckResult]: Stem: 7#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 10#L558-2true [2018-11-18 12:21:11,943 INFO L796 eck$LassoCheckResult]: Loop: 10#L558-2true assume true; 11#L557-1true call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 13#L557-2true assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 5#L557-4true assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 6#L558true assume test_fun_#t~mem10 < test_fun_#t~mem11;havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem12 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem12, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);havoc test_fun_#t~mem12; 10#L558-2true [2018-11-18 12:21:11,947 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:11,948 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 12:21:11,949 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:11,950 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:11,993 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:11,993 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,077 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:12,077 INFO L82 PathProgramCache]: Analyzing trace with hash 34419787, now seen corresponding path program 1 times [2018-11-18 12:21:12,077 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:12,078 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,079 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,079 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:12,103 INFO L82 PathProgramCache]: Analyzing trace with hash 1805859273, now seen corresponding path program 1 times [2018-11-18 12:21:12,104 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:12,104 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,105 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:12,105 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:12,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:12,305 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 68 DAG size of output: 58 [2018-11-18 12:21:12,663 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 12:21:12,808 WARN L180 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:21:12,819 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:21:12,820 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:21:12,820 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:21:12,820 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:21:12,821 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:21:12,821 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:21:12,821 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:21:12,821 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:21:12,821 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration1_Lasso [2018-11-18 12:21:12,821 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:21:12,822 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:21:12,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,852 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,857 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:12,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,236 WARN L180 SmtUtils]: Spent 226.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 95 [2018-11-18 12:21:13,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:13,695 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:21:13,699 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:21:13,701 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-11-18 12:21:13,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,705 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,705 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,708 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-11-18 12:21:13,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,710 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,710 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,714 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-11-18 12:21:13,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,715 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,715 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,716 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-11-18 12:21:13,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,718 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,718 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,718 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,719 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-11-18 12:21:13,719 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,719 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,719 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 12:21:13,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,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-11-18 12:21:13,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,727 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,728 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,729 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,729 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-11-18 12:21:13,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:13,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,730 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:13,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:13,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,731 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-11-18 12:21:13,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,732 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,737 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-11-18 12:21:13,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:13,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,738 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,740 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:13,740 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,748 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-11-18 12:21:13,748 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,749 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,750 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:13,758 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-11-18 12:21:13,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:13,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:13,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:13,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:13,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:13,764 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:13,791 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:21:13,803 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 12:21:13,803 INFO L444 ModelExtractionUtils]: 37 out of 40 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-18 12:21:13,805 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:21:13,807 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:21:13,807 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:21:13,807 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~x_ref~0.base) ULTIMATE.start_test_fun_~x_ref~0.offset)_1 + 4294967291 Supporting invariants [] [2018-11-18 12:21:13,925 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:21:13,929 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:21:13,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:13,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,963 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:13,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:13,980 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:14,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:14,036 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 [2018-11-18 12:21:14,037 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 12 states. Second operand 5 states. [2018-11-18 12:21:14,106 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 12 states.. Second operand 5 states. Result 30 states and 37 transitions. Complement of second has 9 states. [2018-11-18 12:21:14,107 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 [2018-11-18 12:21:14,108 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 12:21:14,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 21 transitions. [2018-11-18 12:21:14,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 5 letters. [2018-11-18 12:21:14,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:14,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 7 letters. Loop has 5 letters. [2018-11-18 12:21:14,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:14,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 21 transitions. Stem has 2 letters. Loop has 10 letters. [2018-11-18 12:21:14,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:14,111 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 37 transitions. [2018-11-18 12:21:14,112 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:21:14,114 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 15 states and 20 transitions. [2018-11-18 12:21:14,115 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-18 12:21:14,115 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-18 12:21:14,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 15 states and 20 transitions. [2018-11-18 12:21:14,116 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 12:21:14,116 INFO L705 BuchiCegarLoop]: Abstraction has 15 states and 20 transitions. [2018-11-18 12:21:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states and 20 transitions. [2018-11-18 12:21:14,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 14. [2018-11-18 12:21:14,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2018-11-18 12:21:14,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 19 transitions. [2018-11-18 12:21:14,133 INFO L728 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-18 12:21:14,133 INFO L608 BuchiCegarLoop]: Abstraction has 14 states and 19 transitions. [2018-11-18 12:21:14,133 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 12:21:14,133 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states and 19 transitions. [2018-11-18 12:21:14,133 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 5 [2018-11-18 12:21:14,134 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 12:21:14,134 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 12:21:14,134 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 12:21:14,134 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1] [2018-11-18 12:21:14,134 INFO L794 eck$LassoCheckResult]: Stem: 268#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 259#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~nondet15, main_#t~nondet16, main_#t~nondet17, main_#t~ret18;assume { :begin_inline_test_fun } true;test_fun_#in~x, test_fun_#in~y, test_fun_#in~z := main_#t~nondet15, main_#t~nondet16, main_#t~nondet17;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~mem10, test_fun_#t~mem11, test_fun_#t~mem12, test_fun_#t~mem13, test_fun_#t~mem6, test_fun_#t~mem7, test_fun_#t~mem8, test_fun_#t~short9, test_fun_#t~mem14, 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;call test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset := #Ultimate.alloc(4);test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset := test_fun_#t~malloc2.base, test_fun_#t~malloc2.offset;call test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset := #Ultimate.alloc(4);test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset := test_fun_#t~malloc3.base, test_fun_#t~malloc3.offset;call test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset := #Ultimate.alloc(4);test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset := test_fun_#t~malloc4.base, test_fun_#t~malloc4.offset;call test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset := #Ultimate.alloc(4);test_fun_~c~0.base, test_fun_~c~0.offset := test_fun_#t~malloc5.base, test_fun_#t~malloc5.offset;call write~int(test_fun_~x, test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call write~int(test_fun_~y, test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);call write~int(test_fun_~z, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(0, test_fun_~c~0.base, test_fun_~c~0.offset, 4); 260#L558-2 assume true; 269#L557-1 [2018-11-18 12:21:14,134 INFO L796 eck$LassoCheckResult]: Loop: 269#L557-1 call test_fun_#t~mem6 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem7 := read~int(test_fun_~y_ref~0.base, test_fun_~y_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem6 < test_fun_#t~mem7; 270#L557-2 assume test_fun_#t~short9;call test_fun_#t~mem8 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);test_fun_#t~short9 := test_fun_#t~mem8 < 2147483647; 261#L557-4 assume !!test_fun_#t~short9;havoc test_fun_#t~mem8;havoc test_fun_#t~mem7;havoc test_fun_#t~short9;havoc test_fun_#t~mem6;call test_fun_#t~mem10 := read~int(test_fun_~x_ref~0.base, test_fun_~x_ref~0.offset, 4);call test_fun_#t~mem11 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4); 262#L558 assume !(test_fun_#t~mem10 < test_fun_#t~mem11);havoc test_fun_#t~mem11;havoc test_fun_#t~mem10;call test_fun_#t~mem13 := read~int(test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);call write~int(1 + test_fun_#t~mem13, test_fun_~z_ref~0.base, test_fun_~z_ref~0.offset, 4);havoc test_fun_#t~mem13; 265#L558-2 assume true; 269#L557-1 [2018-11-18 12:21:14,134 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,135 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 12:21:14,135 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,135 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,136 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,136 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,155 INFO L82 PathProgramCache]: Analyzing trace with hash 36364029, now seen corresponding path program 1 times [2018-11-18 12:21:14,155 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,155 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,156 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,166 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:14,166 INFO L82 PathProgramCache]: Analyzing trace with hash 147062683, now seen corresponding path program 1 times [2018-11-18 12:21:14,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 12:21:14,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 12:21:14,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 12:21:14,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 12:21:14,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 12:21:14,298 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 59 [2018-11-18 12:21:14,563 WARN L180 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 105 [2018-11-18 12:21:14,695 WARN L180 SmtUtils]: Spent 130.00 ms on a formula simplification that was a NOOP. DAG size: 103 [2018-11-18 12:21:14,698 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 12:21:14,698 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 12:21:14,698 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 12:21:14,698 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 12:21:14,698 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 12:21:14,698 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 12:21:14,699 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 12:21:14,699 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 12:21:14,699 INFO L131 ssoRankerPreferences]: Filename of dumped script: c.03-alloca_true-termination_true-no-overflow.c.i_Iteration2_Lasso [2018-11-18 12:21:14,699 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 12:21:14,699 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 12:21:14,702 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:14,709 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:14,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:14,712 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,002 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 108 DAG size of output: 93 [2018-11-18 12:21:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,096 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,099 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,110 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 12:21:15,472 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 12:21:15,472 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 12:21:15,472 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-11-18 12:21:15,473 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,473 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:15,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,473 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,474 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:15,474 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:15,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,475 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-11-18 12:21:15,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,479 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-11-18 12:21:15,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 12:21:15,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,480 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 12:21:15,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 12:21:15,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,481 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-11-18 12:21:15,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,481 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:15,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,481 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,483 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:15,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,487 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,487 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-11-18 12:21:15,487 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,488 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,489 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,489 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,491 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-11-18 12:21:15,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,492 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:15,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,492 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,493 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:15,493 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,497 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-11-18 12:21:15,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,497 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:15,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,499 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:15,499 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,503 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-11-18 12:21:15,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,504 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,505 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,505 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,510 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-11-18 12:21:15,510 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,511 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,511 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,511 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,513 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,513 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-11-18 12:21:15,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,514 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,514 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,515 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,517 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-11-18 12:21:15,517 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,517 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 12:21:15,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,517 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,518 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 12:21:15,518 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,522 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-11-18 12:21:15,522 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,523 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,523 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,523 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,524 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,527 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-11-18 12:21:15,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,528 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,529 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,529 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,530 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 12:21:15,530 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-11-18 12:21:15,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 12:21:15,531 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 12:21:15,531 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 12:21:15,531 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 12:21:15,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 12:21:15,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 12:21:15,545 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 12:21:15,560 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-11-18 12:21:15,560 INFO L444 ModelExtractionUtils]: 33 out of 40 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-18 12:21:15,561 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 12:21:15,561 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 12:21:15,562 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 12:21:15,562 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2) = -2*v_rep(select (select #memory_int ULTIMATE.start_test_fun_~z_ref~0.base) ULTIMATE.start_test_fun_~z_ref~0.offset)_2 + 4294967293 Supporting invariants [] [2018-11-18 12:21:15,686 INFO L297 tatePredicateManager]: 41 out of 41 supporting invariants were superfluous and have been removed [2018-11-18 12:21:15,688 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 12:21:15,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 12:21:15,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:15,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:15,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 12:21:15,723 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 12:21:15,766 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:15,770 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-18 12:21:15,772 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 12:21:15,773 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 26 [2018-11-18 12:21:15,774 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,777 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,780 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 12:21:15,780 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:19 [2018-11-18 12:21:15,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 12:21:15,788 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 12:21:15,789 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states and 19 transitions. cyclomatic complexity: 7 Second operand 6 states. [2018-11-18 12:21:15,809 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states and 19 transitions. cyclomatic complexity: 7. Second operand 6 states. Result 28 states and 40 transitions. Complement of second has 8 states. [2018-11-18 12:21:15,810 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 12:21:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2018-11-18 12:21:15,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 12 transitions. [2018-11-18 12:21:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 5 letters. [2018-11-18 12:21:15,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:15,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 8 letters. Loop has 5 letters. [2018-11-18 12:21:15,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:15,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 12 transitions. Stem has 3 letters. Loop has 10 letters. [2018-11-18 12:21:15,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 12:21:15,812 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 40 transitions. [2018-11-18 12:21:15,813 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:21:15,814 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 12:21:15,814 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 12:21:15,814 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 12:21:15,814 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 12:21:15,814 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 12:21:15,814 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 12:21:15,814 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 12:21:15,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 12:21:15 BoogieIcfgContainer [2018-11-18 12:21:15,819 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 12:21:15,819 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 12:21:15,819 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 12:21:15,819 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 12:21:15,819 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 12:21:11" (3/4) ... [2018-11-18 12:21:15,822 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 12:21:15,822 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 12:21:15,822 INFO L168 Benchmark]: Toolchain (without parser) took 4599.09 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 195.6 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -150.2 MB). Peak memory consumption was 45.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,823 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 12:21:15,823 INFO L168 Benchmark]: CACSL2BoogieTranslator took 318.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,824 INFO L168 Benchmark]: Boogie Procedure Inliner took 28.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,824 INFO L168 Benchmark]: Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,825 INFO L168 Benchmark]: RCFGBuilder took 249.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,825 INFO L168 Benchmark]: BuchiAutomizer took 3978.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. [2018-11-18 12:21:15,826 INFO L168 Benchmark]: Witness Printer took 2.98 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. [2018-11-18 12:21:15,829 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 318.99 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.1 MB). Free memory was 955.5 MB in the beginning and 1.1 GB in the end (delta: -181.2 MB). Peak memory consumption was 30.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 28.70 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 18.03 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 249.31 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 19.7 MB). Peak memory consumption was 19.7 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 3978.08 ms. Allocated memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 52.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.2 MB). Peak memory consumption was 55.6 MB. Max. memory is 11.5 GB. * Witness Printer took 2.98 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 2 terminating modules (0 trivial, 2 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[x_ref][x_ref] + 4294967291 and consists of 6 locations. One deterministic module has affine ranking function -2 * unknown-#memory_int-unknown[z_ref][z_ref] + 4294967293 and consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 3.9s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 3.5s. Construction of modules took 0.0s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 1. Automata minimization 0.0s AutomataMinimizationTime, 1 MinimizatonAttempts, 1 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 14 states and ocurred in iteration 1. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 12 SDtfs, 13 SDslu, 18 SDs, 0 SdLazy, 34 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso2 LassoPreprocessingBenchmarks: Lassos: inital389 mio100 ax104 hnf100 lsp92 ukn59 mio100 lsp37 div100 bol100 ite100 ukn100 eq188 hnf88 smp95 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 10ms VariablesStem: 2 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 2 MotzkinApplications: 8 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...