./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/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 65c6b0abfb5e8339b0bc6a670283e66e92a514b2 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 10:24:59,738 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 10:24:59,739 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 10:24:59,748 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 10:24:59,748 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 10:24:59,749 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 10:24:59,750 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 10:24:59,751 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 10:24:59,752 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 10:24:59,753 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 10:24:59,754 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 10:24:59,754 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 10:24:59,755 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 10:24:59,755 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 10:24:59,756 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 10:24:59,757 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 10:24:59,757 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 10:24:59,759 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 10:24:59,760 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 10:24:59,761 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 10:24:59,762 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 10:24:59,763 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 10:24:59,764 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 10:24:59,764 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 10:24:59,764 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 10:24:59,765 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 10:24:59,766 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 10:24:59,766 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 10:24:59,767 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 10:24:59,768 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 10:24:59,768 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 10:24:59,768 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 10:24:59,768 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 10:24:59,769 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 10:24:59,769 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 10:24:59,770 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 10:24:59,770 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-10 10:24:59,781 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 10:24:59,781 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 10:24:59,782 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-10 10:24:59,782 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-10 10:24:59,782 INFO L133 SettingsManager]: * Use SBE=true [2018-11-10 10:24:59,782 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-10 10:24:59,782 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-10 10:24:59,783 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 10:24:59,783 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-10 10:24:59,784 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-10 10:24:59,784 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 10:24:59,785 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 10:24:59,785 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-10 10:24:59,785 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 10:24:59,785 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-10 10:24:59,785 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-10 10:24:59,786 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-10 10:24:59,786 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_9d8b6dfe-d091-4675-b51c-198123588779/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 -> 65c6b0abfb5e8339b0bc6a670283e66e92a514b2 [2018-11-10 10:24:59,815 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 10:24:59,825 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 10:24:59,828 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 10:24:59,829 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 10:24:59,830 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 10:24:59,830 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i [2018-11-10 10:24:59,883 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/data/94ab01918/6fc22615fe4c4fe5b71f39d9dfe519b9/FLAG11e97d5cc [2018-11-10 10:25:00,242 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 10:25:00,243 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/sv-benchmarks/c/termination-memory-alloca/ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i [2018-11-10 10:25:00,250 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/data/94ab01918/6fc22615fe4c4fe5b71f39d9dfe519b9/FLAG11e97d5cc [2018-11-10 10:25:00,259 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/bin-2019/uautomizer/data/94ab01918/6fc22615fe4c4fe5b71f39d9dfe519b9 [2018-11-10 10:25:00,262 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 10:25:00,263 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 10:25:00,263 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:00,264 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 10:25:00,266 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 10:25:00,266 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,268 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6604a2bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00, skipping insertion in model container [2018-11-10 10:25:00,268 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,275 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 10:25:00,305 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 10:25:00,475 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:00,483 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 10:25:00,508 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 10:25:00,535 INFO L193 MainTranslator]: Completed translation [2018-11-10 10:25:00,535 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00 WrapperNode [2018-11-10 10:25:00,535 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 10:25:00,536 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:00,536 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 10:25:00,536 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 10:25:00,541 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,595 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,612 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 10:25:00,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 10:25:00,613 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 10:25:00,613 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 10:25:00,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,619 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,621 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,622 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,625 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,629 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,630 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... [2018-11-10 10:25:00,632 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 10:25:00,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 10:25:00,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 10:25:00,633 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 10:25:00,633 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9d8b6dfe-d091-4675-b51c-198123588779/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-10 10:25:00,680 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-10 10:25:00,680 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-10 10:25:00,681 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 10:25:00,681 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 10:25:00,929 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 10:25:00,929 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:00 BoogieIcfgContainer [2018-11-10 10:25:00,929 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 10:25:00,930 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-10 10:25:00,930 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-10 10:25:00,933 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-10 10:25:00,934 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:25:00,934 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 10.11 10:25:00" (1/3) ... [2018-11-10 10:25:00,935 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314821a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:25:00, skipping insertion in model container [2018-11-10 10:25:00,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:25:00,935 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 10:25:00" (2/3) ... [2018-11-10 10:25:00,935 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@314821a3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 10.11 10:25:00, skipping insertion in model container [2018-11-10 10:25:00,935 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-10 10:25:00,936 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:00" (3/3) ... [2018-11-10 10:25:00,937 INFO L375 chiAutomizerObserver]: Analyzing ICFG ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i [2018-11-10 10:25:00,974 INFO L135 ementStrategyFactory]: Using default assertion order modulation [2018-11-10 10:25:00,974 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-10 10:25:00,974 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-10 10:25:00,974 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-10 10:25:00,974 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 10:25:00,974 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 10:25:00,974 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-10 10:25:00,975 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 10:25:00,975 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-10 10:25:00,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 10:25:00,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 10:25:01,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:25:01,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:25:01,004 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:01,005 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:01,005 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-10 10:25:01,005 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states. [2018-11-10 10:25:01,006 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 13 [2018-11-10 10:25:01,006 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-10 10:25:01,007 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-10 10:25:01,007 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:01,007 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 10:25:01,015 INFO L793 eck$LassoCheckResult]: Stem: 23#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 8#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_#t~malloc2.base, main_#t~malloc2.offset, main_#t~malloc3.base, main_#t~malloc3.offset, main_#t~malloc4.base, main_#t~malloc4.offset, main_#t~nondet5, main_#t~nondet6, main_#t~nondet7, main_#t~mem9, main_#t~mem10, main_#t~mem11, main_#t~mem12, main_#t~mem8, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;#Ultimate.alloc_old_#length, #Ultimate.alloc_old_#valid := #length, #valid;assume { :begin_inline_#Ultimate.alloc } true;#Ultimate.alloc_~size := 4;havoc #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;havoc #valid, #length;assume #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base] == 0;assume #valid == #Ultimate.alloc_old_#valid[#Ultimate.alloc_#res.base := 1];assume #Ultimate.alloc_#res.offset == 0;assume #Ultimate.alloc_#res.base != 0;assume #length == #Ultimate.alloc_old_#length[#Ultimate.alloc_#res.base := #Ultimate.alloc_~size];main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc_#res.base, #Ultimate.alloc_#res.offset;assume { :end_inline_#Ultimate.alloc } true;main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 26#L551true SUMMARY for call write~int(main_#t~nondet5, main_~x~0.base, main_~x~0.offset, 4); srcloc: L551 27#L551-1true havoc main_#t~nondet5; 10#L552true SUMMARY for call write~int(main_#t~nondet6, main_~y~0.base, main_~y~0.offset, 4); srcloc: L552 12#L552-1true havoc main_#t~nondet6; 21#L553true SUMMARY for call write~int(main_#t~nondet7, main_~z~0.base, main_~z~0.offset, 4); srcloc: L553 24#L553-1true havoc main_#t~nondet7; 14#L554-4true [2018-11-10 10:25:01,015 INFO L795 eck$LassoCheckResult]: Loop: 14#L554-4true assume true; 9#L554-1true SUMMARY for call main_#t~mem8 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L554-1 11#L554-2true assume !!(main_#t~mem8 > 0);havoc main_#t~mem8; 5#L555true SUMMARY for call main_#t~mem9 := read~int(main_~x~0.base, main_~x~0.offset, 4); srcloc: L555 7#L555-1true SUMMARY for call main_#t~mem10 := read~int(main_~y~0.base, main_~y~0.offset, 4); srcloc: L555-1 22#L555-2true SUMMARY for call write~int(main_#t~mem9 + main_#t~mem10, main_~x~0.base, main_~x~0.offset, 4); srcloc: L555-2 25#L555-3true havoc main_#t~mem9;havoc main_#t~mem10; 18#L556true SUMMARY for call main_#t~mem11 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L556 19#L556-1true SUMMARY for call write~int(main_#t~mem11, main_~y~0.base, main_~y~0.offset, 4); srcloc: L556-1 20#L556-2true havoc main_#t~mem11; 3#L557true SUMMARY for call main_#t~mem12 := read~int(main_~z~0.base, main_~z~0.offset, 4); srcloc: L557 4#L557-1true SUMMARY for call write~int(-main_#t~mem12 - 1, main_~z~0.base, main_~z~0.offset, 4); srcloc: L557-1 6#L557-2true havoc main_#t~mem12; 14#L554-4true [2018-11-10 10:25:01,020 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:01,020 INFO L82 PathProgramCache]: Analyzing trace with hash 57289382, now seen corresponding path program 1 times [2018-11-10 10:25:01,022 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:25:01,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:25:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,058 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:01,058 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,125 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:01,125 INFO L82 PathProgramCache]: Analyzing trace with hash -1602856011, now seen corresponding path program 1 times [2018-11-10 10:25:01,125 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:25:01,125 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:25:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,127 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:01,127 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,154 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:01,154 INFO L82 PathProgramCache]: Analyzing trace with hash -262970064, now seen corresponding path program 1 times [2018-11-10 10:25:01,154 INFO L225 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-10 10:25:01,154 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-10 10:25:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,155 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 10:25:01,155 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 10:25:01,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-10 10:25:01,554 WARN L179 SmtUtils]: Spent 211.00 ms on a formula simplification. DAG size of input: 103 DAG size of output: 91 [2018-11-10 10:25:01,661 INFO L214 LassoAnalysis]: Preferences: [2018-11-10 10:25:01,662 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-10 10:25:01,662 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-10 10:25:01,662 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-10 10:25:01,662 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-10 10:25:01,662 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-10 10:25:01,662 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-10 10:25:01,662 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-10 10:25:01,663 INFO L131 ssoRankerPreferences]: Filename of dumped script: ChenFlurMukhopadhyay-2012SAS-Fig1-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-10 10:25:01,663 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-10 10:25:01,663 INFO L280 LassoAnalysis]: Starting lasso preprocessing... [2018-11-10 10:25:01,678 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-10 10:25:01,682 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-10 10:25:01,986 WARN L179 SmtUtils]: Spent 202.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 99 [2018-11-10 10:25:02,110 WARN L179 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 79 DAG size of output: 76 [2018-11-10 10:25:02,111 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-10 10:25:02,115 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-10 10:25:02,116 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-10 10:25:02,118 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-10 10:25:02,120 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-10 10:25:02,125 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-10 10:25:02,126 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-10 10:25:02,128 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-10 10:25:02,130 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-10 10:25:02,132 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-10 10:25:02,134 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-10 10:25:02,136 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-10 10:25:02,138 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-10 10:25:02,561 INFO L298 LassoAnalysis]: Preprocessing complete. [2018-11-10 10:25:02,565 INFO L496 LassoAnalysis]: Using template 'affine'. [2018-11-10 10:25:02,566 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-10 10:25:02,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,569 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,570 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,570 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,571 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,572 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-10 10:25:02,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,575 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,582 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,583 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-10 10:25:02,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,586 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,586 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,590 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,590 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-10 10:25:02,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,591 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,594 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:25:02,594 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,606 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,606 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-10 10:25:02,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,607 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,609 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,609 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,613 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,614 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-10 10:25:02,614 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,614 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,614 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,614 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,616 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:25:02,616 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,625 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,626 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-10 10:25:02,626 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,626 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,627 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,628 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-10 10:25:02,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,636 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,637 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-10 10:25:02,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,638 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,638 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,638 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,640 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,640 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,655 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,655 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-10 10:25:02,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,658 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,658 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,670 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,670 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-10 10:25:02,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,674 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,674 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,681 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,681 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-10 10:25:02,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,682 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,682 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,682 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,685 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,685 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,693 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,694 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-10 10:25:02,695 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,697 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,697 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,699 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,700 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-10 10:25:02,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,729 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,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-10 10:25:02,730 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,730 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,730 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,730 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,730 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,731 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,731 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,731 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,732 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-10 10:25:02,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,733 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,734 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,734 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-10 10:25:02,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,735 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,735 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,736 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,736 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-10 10:25:02,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,737 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,739 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,739 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-10 10:25:02,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,740 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,740 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,741 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,741 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,741 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-10 10:25:02,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,742 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,743 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,743 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,749 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,749 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-10 10:25:02,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,750 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,752 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,752 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-10 10:25:02,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,753 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,753 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,754 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,755 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-10 10:25:02,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,755 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,760 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,760 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,760 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,761 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,761 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-10 10:25:02,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,762 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,762 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,762 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,763 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,763 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,765 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,765 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-10 10:25:02,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,766 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,767 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,768 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-10 10:25:02,769 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,769 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,770 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-10 10:25:02,770 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-10 10:25:02,772 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,772 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-10 10:25:02,773 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,773 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,773 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-10 10:25:02,773 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-10 10:25:02,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,774 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,774 INFO L496 LassoAnalysis]: Using template '2-nested'. [2018-11-10 10:25:02,775 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-10 10:25:02,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,775 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,776 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,776 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,776 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,777 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-10 10:25:02,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,777 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,778 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,779 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,780 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,781 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-10 10:25:02,781 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,781 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,782 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,783 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,784 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,785 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-10 10:25:02,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,785 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,785 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,787 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,787 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,793 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,794 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-10 10:25:02,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,795 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,796 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,796 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,798 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,798 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-10 10:25:02,799 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,799 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,799 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,799 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,800 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,800 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,806 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,806 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-10 10:25:02,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,807 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,807 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,807 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,808 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,808 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,813 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,814 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-10 10:25:02,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,816 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,816 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,827 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,827 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-10 10:25:02,828 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,828 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,829 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,829 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,837 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,838 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-10 10:25:02,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,839 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,840 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,840 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,846 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,847 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-10 10:25:02,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,848 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,849 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,849 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,858 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,858 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-10 10:25:02,859 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,860 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,861 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,861 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,862 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,863 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-10 10:25:02,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,864 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,868 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,869 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,892 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,892 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-10 10:25:02,893 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,893 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,893 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,894 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,894 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-10 10:25:02,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,895 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,895 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,896 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,896 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-10 10:25:02,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,897 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,897 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,898 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,898 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-10 10:25:02,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,899 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,899 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,899 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,900 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,901 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-10 10:25:02,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,901 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,901 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,901 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,902 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,902 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,902 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,902 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-10 10:25:02,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,903 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,904 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,904 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,906 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,906 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-10 10:25:02,907 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,908 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,908 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,909 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,909 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-10 10:25:02,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,909 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,910 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,910 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,910 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,911 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,911 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-10 10:25:02,911 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,912 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,912 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,912 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,912 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,913 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,913 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-10 10:25:02,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,913 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,914 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,914 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,916 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,916 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-10 10:25:02,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,916 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,917 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,917 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,917 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,917 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,918 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-10 10:25:02,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,918 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,919 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-10 10:25:02,919 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-10 10:25:02,921 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,922 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-10 10:25:02,922 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,922 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,922 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,922 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,922 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-10 10:25:02,923 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-10 10:25:02,923 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,923 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,923 INFO L496 LassoAnalysis]: Using template '3-nested'. [2018-11-10 10:25:02,924 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-10 10:25:02,924 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-10 10:25:02,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,924 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,925 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-10 10:25:02,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-10 10:25:02,925 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,926 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-10 10:25:02,926 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,927 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,928 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,930 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,931 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-10 10:25:02,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,931 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,931 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,931 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,932 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,933 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,935 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,935 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-10 10:25:02,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,936 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,936 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,936 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,937 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 10:25:02,937 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,945 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,945 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-10 10:25:02,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,946 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,946 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,946 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,947 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,947 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,950 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,951 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-10 10:25:02,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,951 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,953 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 10:25:02,953 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,959 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,959 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-10 10:25:02,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,959 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-10 10:25:02,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,960 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,961 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-10 10:25:02,961 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,967 INFO L529 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-10 10:25:02,967 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-10 10:25:02,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-10 10:25:02,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-10 10:25:02,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-10 10:25:02,968 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-10 10:25:02,970 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-10 10:25:02,970 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-10 10:25:02,990 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-10 10:25:03,020 INFO L443 ModelExtractionUtils]: Simplification made 8 calls to the SMT solver. [2018-11-10 10:25:03,020 INFO L444 ModelExtractionUtils]: 19 out of 29 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-10 10:25:03,023 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-10 10:25:03,024 INFO L440 nArgumentSynthesizer]: Removed 4 redundant supporting invariants from a total of 4. [2018-11-10 10:25:03,024 INFO L517 LassoAnalysis]: Proved termination. [2018-11-10 10:25:03,025 INFO L519 LassoAnalysis]: Termination argument consisting of: Ranking function 3-nested ranking function: f0 = 2*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_1 + 2*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 f1 = 3*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 + 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_1 f2 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-10 10:25:03,145 INFO L297 tatePredicateManager]: 21 out of 24 supporting invariants were superfluous and have been removed [2018-11-10 10:25:03,157 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,158 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,161 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,162 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,163 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 10:25:03,204 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:03,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:03,230 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:03,266 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:03,270 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 10:25:03,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:03,293 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:03,294 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:25:03,294 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:03,298 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:03,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:03,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 10:25:03,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:03,321 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:03,494 WARN L179 SmtUtils]: Spent 139.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2018-11-10 10:25:03,650 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:03,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:03,657 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 67 treesize of output 54 [2018-11-10 10:25:03,658 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:03,675 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,331 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-11-10 10:25:04,334 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-11-10 10:25:04,336 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,349 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:04,538 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:04,542 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:04,543 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-11-10 10:25:04,545 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,559 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,886 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-11-10 10:25:04,890 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-11-10 10:25:04,891 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:04,904 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,028 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2018-11-10 10:25:05,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-11-10 10:25:05,034 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,048 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,156 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:05,159 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:05,163 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:05,164 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-11-10 10:25:05,165 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,180 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,272 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 9 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 10:25:05,272 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 27 variables, input treesize:945, output treesize:405 [2018-11-10 10:25:05,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 79 [2018-11-10 10:25:05,502 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 45 [2018-11-10 10:25:05,503 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,517 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,587 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 77 [2018-11-10 10:25:05,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 45 [2018-11-10 10:25:05,591 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,604 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,654 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 73 [2018-11-10 10:25:05,657 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2018-11-10 10:25:05,658 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,670 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:05,712 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 10:25:05,712 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:259, output treesize:198 [2018-11-10 10:25:05,874 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 78 [2018-11-10 10:25:05,878 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 42 [2018-11-10 10:25:05,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:05,892 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:05,959 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 76 [2018-11-10 10:25:05,966 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-10 10:25:05,967 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:05,982 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:06,046 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 89 treesize of output 80 [2018-11-10 10:25:06,050 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 32 [2018-11-10 10:25:06,050 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:06,066 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:06,122 INFO L267 ElimStorePlain]: Start of recursive call 1: 9 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 10:25:06,123 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 12 variables, input treesize:264, output treesize:211 [2018-11-10 10:25:06,226 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-10 10:25:06,236 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-10 10:25:06,236 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 13 states. [2018-11-10 10:25:10,910 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 13 states. Result 54 states and 55 transitions. Complement of second has 19 states. [2018-11-10 10:25:10,911 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 11 states 2 stem states 7 non-accepting loop states 1 accepting loop states [2018-11-10 10:25:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 10:25:10,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 24 transitions. [2018-11-10 10:25:10,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 11 states and 24 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 10:25:10,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:25:10,915 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-10 10:25:10,954 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 10:25:10,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:10,962 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:10,969 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:10,969 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 29 [2018-11-10 10:25:10,979 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:10,980 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:10,981 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 13 [2018-11-10 10:25:10,981 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:10,984 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:10,987 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:10,987 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-10 10:25:11,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 10:25:11,002 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 10:25:11,186 WARN L179 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 77 DAG size of output: 53 [2018-11-10 10:25:11,338 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-10 10:25:11,339 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:11,627 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-11-10 10:25:11,630 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-11-10 10:25:11,630 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:11,644 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:11,866 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:11,868 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:11,871 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:11,871 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 54 [2018-11-10 10:25:11,872 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:11,892 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,073 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:12,074 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:12,077 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 67 treesize of output 54 [2018-11-10 10:25:12,078 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,093 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,408 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 102 treesize of output 89 [2018-11-10 10:25:12,411 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 56 [2018-11-10 10:25:12,412 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,428 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,558 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 83 [2018-11-10 10:25:12,562 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 52 [2018-11-10 10:25:12,562 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,581 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,801 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:12,802 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 89 [2018-11-10 10:25:12,805 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 67 treesize of output 54 [2018-11-10 10:25:12,806 INFO L267 ElimStorePlain]: Start of recursive call 14: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,822 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:12,944 INFO L267 ElimStorePlain]: Start of recursive call 1: 18 dim-0 vars, 9 dim-2 vars, End of recursive call: 6 dim-0 vars, and 6 xjuncts. [2018-11-10 10:25:12,944 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 27 variables, input treesize:945, output treesize:405 [2018-11-10 10:25:13,127 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 76 [2018-11-10 10:25:13,130 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 49 [2018-11-10 10:25:13,131 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,142 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,200 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 79 treesize of output 70 [2018-11-10 10:25:13,203 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 42 [2018-11-10 10:25:13,204 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,215 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,262 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 74 [2018-11-10 10:25:13,265 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 49 [2018-11-10 10:25:13,266 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,276 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-10 10:25:13,314 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 10:25:13,314 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 6 variables, input treesize:250, output treesize:198 [2018-11-10 10:25:13,490 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,491 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 87 [2018-11-10 10:25:13,494 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,494 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 60 [2018-11-10 10:25:13,495 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,506 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,565 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,566 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 85 [2018-11-10 10:25:13,569 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,569 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-11-10 10:25:13,570 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,581 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,629 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 86 treesize of output 89 [2018-11-10 10:25:13,634 INFO L700 Elim1Store]: detected not equals via solver [2018-11-10 10:25:13,634 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2018-11-10 10:25:13,634 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,646 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 10:25:13,684 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 3 dim-2 vars, End of recursive call: 6 dim-0 vars, and 3 xjuncts. [2018-11-10 10:25:13,684 INFO L202 ElimStorePlain]: Needed 7 recursive calls to eliminate 9 variables, input treesize:255, output treesize:210 [2018-11-10 10:25:13,757 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-10 10:25:13,757 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 10 loop predicates [2018-11-10 10:25:13,758 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 25 states. Second operand 13 states. [2018-11-10 10:25:14,587 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 25 states.. Second operand 13 states. Result 46 states and 48 transitions. Complement of second has 24 states. [2018-11-10 10:25:14,588 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 14 states 2 stem states 10 non-accepting loop states 1 accepting loop states [2018-11-10 10:25:14,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2018-11-10 10:25:14,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 29 transitions. [2018-11-10 10:25:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 29 transitions. Stem has 8 letters. Loop has 13 letters. [2018-11-10 10:25:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:25:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 29 transitions. Stem has 21 letters. Loop has 13 letters. [2018-11-10 10:25:14,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:25:14,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 14 states and 29 transitions. Stem has 8 letters. Loop has 26 letters. [2018-11-10 10:25:14,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-10 10:25:14,590 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 46 states and 48 transitions. [2018-11-10 10:25:14,592 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:25:14,594 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 46 states to 0 states and 0 transitions. [2018-11-10 10:25:14,594 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-10 10:25:14,594 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-10 10:25:14,595 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-10 10:25:14,595 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-10 10:25:14,595 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:25:14,595 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:25:14,595 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 10:25:14,595 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-10 10:25:14,595 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-10 10:25:14,595 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-10 10:25:14,595 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-10 10:25:14,599 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 10.11 10:25:14 BoogieIcfgContainer [2018-11-10 10:25:14,599 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-10 10:25:14,599 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 10:25:14,600 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 10:25:14,600 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 10:25:14,600 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 10:25:00" (3/4) ... [2018-11-10 10:25:14,602 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-10 10:25:14,602 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 10:25:14,603 INFO L168 Benchmark]: Toolchain (without parser) took 14340.77 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 317.7 MB). Free memory was 955.4 MB in the beginning and 1.3 GB in the end (delta: -323.7 MB). There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:14,603 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:14,603 INFO L168 Benchmark]: CACSL2BoogieTranslator took 272.04 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:14,604 INFO L168 Benchmark]: Boogie Procedure Inliner took 76.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:14,604 INFO L168 Benchmark]: Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:14,604 INFO L168 Benchmark]: RCFGBuilder took 297.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:14,604 INFO L168 Benchmark]: BuchiAutomizer took 13669.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. [2018-11-10 10:25:14,605 INFO L168 Benchmark]: Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 10:25:14,607 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 272.04 ms. Allocated memory is still 1.0 GB. Free memory was 955.4 MB in the beginning and 933.9 MB in the end (delta: 21.5 MB). Peak memory consumption was 21.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 76.52 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 933.9 MB in the beginning and 1.1 GB in the end (delta: -163.5 MB). Peak memory consumption was 15.8 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.66 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.6 MB). Peak memory consumption was 3.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 297.16 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 26.5 MB). Peak memory consumption was 26.5 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 13669.39 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 217.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -211.7 MB). Peak memory consumption was 5.3 MB. Max. memory is 11.5 GB. * Witness Printer took 2.79 ms. Allocated memory is still 1.3 GB. Free memory is still 1.3 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 - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 1 terminating modules (0 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has 3-nested ranking function (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 1 else 0)), (if 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] > 0 then 2 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[z][z] + 2 * unknown-#memory_int-unknown[y][y] else (if 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] > 0 then 3 * unknown-#memory_int-unknown[x][x] + unknown-#memory_int-unknown[y][y] else unknown-#memory_int-unknown[x][x])) and consists of 14 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 13.6s and 2 iterations. TraceHistogramMax:1. Analysis of lassos took 2.1s. Construction of modules took 5.0s. Büchi inclusion checks took 6.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 0. Automata minimization No data available. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 0 states and ocurred in iteration 1. Nontrivial modules had stage [0, 1, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 22 SDtfs, 46 SDslu, 73 SDs, 0 SdLazy, 132 SolverSat, 19 SolverUnsat, 1 SolverUnknown, 0 SolverNotchecked, 5.0s Time LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital455 mio100 ax103 hnf100 lsp94 ukn52 mio100 lsp41 div100 bol100 ite100 ukn100 eq194 hnf87 smp94 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 9ms VariablesStem: 3 VariablesLoop: 2 DisjunctsStem: 2 DisjunctsLoop: 1 SupportingInvariants: 4 MotzkinApplications: 16 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...