./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/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 3cca4963db77635bc2da65f99e90064d806437e6 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-5842f4b [2018-11-18 10:59:12,762 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 10:59:12,764 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 10:59:12,771 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 10:59:12,772 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 10:59:12,772 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 10:59:12,773 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 10:59:12,775 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 10:59:12,776 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 10:59:12,777 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 10:59:12,778 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 10:59:12,778 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 10:59:12,779 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 10:59:12,779 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 10:59:12,780 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 10:59:12,781 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 10:59:12,782 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 10:59:12,783 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 10:59:12,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 10:59:12,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 10:59:12,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 10:59:12,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 10:59:12,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 10:59:12,790 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 10:59:12,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 10:59:12,791 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 10:59:12,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 10:59:12,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 10:59:12,793 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 10:59:12,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 10:59:12,794 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 10:59:12,794 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 10:59:12,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 10:59:12,795 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 10:59:12,795 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 10:59:12,796 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 10:59:12,796 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-18 10:59:12,808 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 10:59:12,808 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 10:59:12,809 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 10:59:12,810 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 10:59:12,810 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 10:59:12,810 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 10:59:12,810 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 10:59:12,810 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 10:59:12,810 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 10:59:12,811 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 10:59:12,811 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 10:59:12,812 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 10:59:12,813 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 10:59:12,813 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 10:59:12,813 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 10:59:12,813 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 10:59:12,813 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 10:59:12,813 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 10:59:12,814 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 10:59:12,814 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_63199d5e-471d-4e2f-a489-1e047a69a3ae/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 -> 3cca4963db77635bc2da65f99e90064d806437e6 [2018-11-18 10:59:12,837 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 10:59:12,846 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 10:59:12,848 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 10:59:12,848 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 10:59:12,849 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 10:59:12,849 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-18 10:59:12,884 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/data/360ccded4/bbed8fe465db4fbe827f97a13b2523ca/FLAG629bad644 [2018-11-18 10:59:13,307 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 10:59:13,308 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-18 10:59:13,314 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/data/360ccded4/bbed8fe465db4fbe827f97a13b2523ca/FLAG629bad644 [2018-11-18 10:59:13,322 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/data/360ccded4/bbed8fe465db4fbe827f97a13b2523ca [2018-11-18 10:59:13,324 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 10:59:13,325 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 10:59:13,325 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 10:59:13,325 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 10:59:13,328 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 10:59:13,329 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,331 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7be20a0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13, skipping insertion in model container [2018-11-18 10:59:13,331 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,337 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 10:59:13,365 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 10:59:13,550 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:59:13,556 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 10:59:13,584 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 10:59:13,655 INFO L195 MainTranslator]: Completed translation [2018-11-18 10:59:13,656 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13 WrapperNode [2018-11-18 10:59:13,656 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 10:59:13,656 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 10:59:13,656 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 10:59:13,656 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 10:59:13,661 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,669 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,680 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 10:59:13,681 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 10:59:13,681 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 10:59:13,681 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 10:59:13,686 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,688 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,692 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,695 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,696 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... [2018-11-18 10:59:13,698 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 10:59:13,698 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 10:59:13,698 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 10:59:13,698 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 10:59:13,699 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_63199d5e-471d-4e2f-a489-1e047a69a3ae/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-18 10:59:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-18 10:59:13,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-18 10:59:13,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-18 10:59:13,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 10:59:13,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 10:59:13,876 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 10:59:13,876 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:13 BoogieIcfgContainer [2018-11-18 10:59:13,876 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 10:59:13,877 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 10:59:13,877 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 10:59:13,880 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 10:59:13,880 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:59:13,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 10:59:13" (1/3) ... [2018-11-18 10:59:13,881 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1741b8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:59:13, skipping insertion in model container [2018-11-18 10:59:13,881 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:59:13,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 10:59:13" (2/3) ... [2018-11-18 10:59:13,882 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1741b8fb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 10:59:13, skipping insertion in model container [2018-11-18 10:59:13,882 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 10:59:13,882 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:13" (3/3) ... [2018-11-18 10:59:13,883 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-11-18 10:59:13,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 10:59:13,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 10:59:13,927 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 10:59:13,927 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 10:59:13,927 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 10:59:13,927 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 10:59:13,927 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 10:59:13,927 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 10:59:13,927 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 10:59:13,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 10:59:13,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 10:59:13,956 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:13,956 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:13,962 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:59:13,962 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:13,962 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 10:59:13,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-18 10:59:13,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 10:59:13,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:13,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:13,964 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-18 10:59:13,964 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:13,970 INFO L794 eck$LassoCheckResult]: Stem: 10#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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L554-2true [2018-11-18 10:59:13,970 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true assume true; 14#L551-1true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 16#L551-2true assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4#L551-4true main_#t~short9 := main_#t~short7; 5#L551-5true assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6#L551-7true assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 12#L552true assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 11#L554-2true [2018-11-18 10:59:13,975 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:13,975 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-18 10:59:13,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:13,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:14,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,046 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:14,046 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 1 times [2018-11-18 10:59:14,046 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:14,046 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,048 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:14,048 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:14,075 INFO L82 PathProgramCache]: Analyzing trace with hash 263851596, now seen corresponding path program 1 times [2018-11-18 10:59:14,075 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:14,075 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,076 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:14,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:14,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:14,263 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-11-18 10:59:14,392 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:59:14,393 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:59:14,393 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:59:14,393 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:59:14,393 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:59:14,394 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:14,394 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:59:14,394 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:59:14,394 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2018-11-18 10:59:14,394 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:59:14,394 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:59:14,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,417 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,420 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,609 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 66 DAG size of output: 57 [2018-11-18 10:59:14,711 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,713 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,715 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,716 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,726 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,730 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,737 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,739 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,742 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:14,744 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:15,046 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:59:15,050 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:59:15,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:15,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:15,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:15,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:15,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,060 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:59:15,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,061 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:59:15,061 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:15,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:15,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:15,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:15,066 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,068 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,068 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,070 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:15,070 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:15,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,075 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:15,075 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:15,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,080 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:15,080 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,080 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,082 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:15,082 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:15,091 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,092 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,092 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,092 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,092 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,094 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:15,094 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:15,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,103 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,104 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:15,104 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:15,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:15,114 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:15,114 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:15,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:15,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:15,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:15,115 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:15,115 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:15,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:15,119 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:59:15,122 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:59:15,122 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:59:15,124 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:59:15,124 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-11-18 10:59:15,124 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:59:15,125 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(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_~x~0.base) ULTIMATE.start_main_~x~0.offset)_1 Supporting invariants [] [2018-11-18 10:59:15,186 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 10:59:15,190 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:59:15,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:15,213 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:15,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:15,225 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:15,259 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:15,273 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:59:15,274 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 5 states. [2018-11-18 10:59:15,345 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 5 states. Result 63 states and 81 transitions. Complement of second has 10 states. [2018-11-18 10:59:15,345 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:15,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:59:15,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 32 transitions. [2018-11-18 10:59:15,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 7 letters. [2018-11-18 10:59:15,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:15,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 9 letters. Loop has 7 letters. [2018-11-18 10:59:15,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:15,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 32 transitions. Stem has 2 letters. Loop has 14 letters. [2018-11-18 10:59:15,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:15,350 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 81 transitions. [2018-11-18 10:59:15,352 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:15,355 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 37 states and 52 transitions. [2018-11-18 10:59:15,355 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 24 [2018-11-18 10:59:15,356 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-18 10:59:15,356 INFO L73 IsDeterministic]: Start isDeterministic. Operand 37 states and 52 transitions. [2018-11-18 10:59:15,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:59:15,356 INFO L705 BuchiCegarLoop]: Abstraction has 37 states and 52 transitions. [2018-11-18 10:59:15,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states and 52 transitions. [2018-11-18 10:59:15,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2018-11-18 10:59:15,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-18 10:59:15,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 47 transitions. [2018-11-18 10:59:15,375 INFO L728 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-11-18 10:59:15,375 INFO L608 BuchiCegarLoop]: Abstraction has 34 states and 47 transitions. [2018-11-18 10:59:15,375 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 10:59:15,375 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 34 states and 47 transitions. [2018-11-18 10:59:15,376 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:15,376 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:15,376 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:15,376 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-11-18 10:59:15,377 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:15,377 INFO L794 eck$LassoCheckResult]: Stem: 234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 232#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 233#L554-2 assume true; 244#L551-1 [2018-11-18 10:59:15,377 INFO L796 eck$LassoCheckResult]: Loop: 244#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 258#L551-2 assume !main_#t~short7; 259#L551-4 main_#t~short9 := main_#t~short7; 262#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 261#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 260#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 243#L554-2 assume true; 244#L551-1 [2018-11-18 10:59:15,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,377 INFO L82 PathProgramCache]: Analyzing trace with hash 29859, now seen corresponding path program 1 times [2018-11-18 10:59:15,377 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:15,377 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:15,378 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,379 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,379 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,385 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,385 INFO L82 PathProgramCache]: Analyzing trace with hash 639499098, now seen corresponding path program 1 times [2018-11-18 10:59:15,385 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:15,385 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,386 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,386 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:15,419 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:15,420 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 10:59:15,421 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-18 10:59:15,422 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 10:59:15,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-18 10:59:15,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-18 10:59:15,424 INFO L87 Difference]: Start difference. First operand 34 states and 47 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-11-18 10:59:15,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 10:59:15,460 INFO L93 Difference]: Finished difference Result 36 states and 40 transitions. [2018-11-18 10:59:15,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-18 10:59:15,461 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 40 transitions. [2018-11-18 10:59:15,462 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 10:59:15,462 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 24 states and 28 transitions. [2018-11-18 10:59:15,462 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 17 [2018-11-18 10:59:15,463 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 17 [2018-11-18 10:59:15,463 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 28 transitions. [2018-11-18 10:59:15,463 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:59:15,463 INFO L705 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 10:59:15,463 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states and 28 transitions. [2018-11-18 10:59:15,465 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2018-11-18 10:59:15,465 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-18 10:59:15,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 28 transitions. [2018-11-18 10:59:15,466 INFO L728 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 10:59:15,466 INFO L608 BuchiCegarLoop]: Abstraction has 24 states and 28 transitions. [2018-11-18 10:59:15,466 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 10:59:15,466 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 24 states and 28 transitions. [2018-11-18 10:59:15,467 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 8 [2018-11-18 10:59:15,467 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:15,467 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:15,467 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:15,467 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:15,468 INFO L794 eck$LassoCheckResult]: Stem: 317#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 311#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 312#L554-2 assume true; 324#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 334#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 333#L551-4 main_#t~short9 := main_#t~short7; 332#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 331#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 318#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 319#L554 [2018-11-18 10:59:15,468 INFO L796 eck$LassoCheckResult]: Loop: 319#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 322#L554-2 assume true; 323#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 328#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 313#L551-4 main_#t~short9 := main_#t~short7; 314#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 326#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 330#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 319#L554 [2018-11-18 10:59:15,468 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,468 INFO L82 PathProgramCache]: Analyzing trace with hash 263851598, now seen corresponding path program 1 times [2018-11-18 10:59:15,468 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:15,468 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,469 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,469 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,489 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,489 INFO L82 PathProgramCache]: Analyzing trace with hash -1411733488, now seen corresponding path program 1 times [2018-11-18 10:59:15,489 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:15,489 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:15,491 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,492 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,492 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:15,523 INFO L82 PathProgramCache]: Analyzing trace with hash -1204020899, now seen corresponding path program 1 times [2018-11-18 10:59:15,523 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:15,523 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:15,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,524 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:15,524 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:15,535 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:15,696 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-11-18 10:59:15,861 WARN L180 SmtUtils]: Spent 125.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 78 [2018-11-18 10:59:15,894 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:59:15,895 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:59:15,895 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:59:15,895 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:59:15,895 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:59:15,895 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:15,895 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:59:15,895 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:59:15,895 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-11-18 10:59:15,895 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:59:15,895 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:59:15,898 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:15,900 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:15,901 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:15,902 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:15,904 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,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-18 10:59:16,122 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,123 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,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-18 10:59:16,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-18 10:59:16,127 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,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-18 10:59:16,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,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-18 10:59:16,137 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:16,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-18 10:59:16,370 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:59:16,370 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:59:16,370 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:16,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:16,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:16,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:16,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:16,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:16,372 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:16,372 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:16,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:16,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:16,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:16,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:16,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:16,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:16,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:16,374 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:16,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:16,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:16,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:16,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:16,375 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:16,375 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:16,375 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 10:59:16,376 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:16,376 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 10:59:16,376 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:16,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:16,378 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:16,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:16,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:16,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:16,379 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:16,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:16,380 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:16,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:16,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:16,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:16,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:16,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:16,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:16,383 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:16,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:16,394 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:59:16,401 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:59:16,402 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 10:59:16,402 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:59:16,404 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:59:16,404 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:59:16,404 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_2 Supporting invariants [] [2018-11-18 10:59:16,457 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 10:59:16,458 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:59:16,472 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,497 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 10:59:16,504 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:16,506 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:16,507 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 10:59:16,507 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,511 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,516 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,516 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 10:59:16,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:16,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:16,531 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:16,532 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 10:59:16,538 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:16,539 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 28 treesize of output 19 [2018-11-18 10:59:16,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,551 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 10:59:16,554 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:59:16,554 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,559 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,564 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,570 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:16,570 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-18 10:59:16,681 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:16,681 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 10:59:16,681 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-11-18 10:59:16,801 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 24 states and 28 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 55 states and 65 transitions. Complement of second has 12 states. [2018-11-18 10:59:16,802 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:16,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 10:59:16,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-18 10:59:16,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 9 letters. Loop has 8 letters. [2018-11-18 10:59:16,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:16,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 17 letters. Loop has 8 letters. [2018-11-18 10:59:16,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:16,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 9 letters. Loop has 16 letters. [2018-11-18 10:59:16,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:16,804 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 65 transitions. [2018-11-18 10:59:16,805 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:16,806 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 49 states and 58 transitions. [2018-11-18 10:59:16,806 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 26 [2018-11-18 10:59:16,806 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 28 [2018-11-18 10:59:16,806 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 58 transitions. [2018-11-18 10:59:16,806 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:59:16,806 INFO L705 BuchiCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-11-18 10:59:16,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states and 58 transitions. [2018-11-18 10:59:16,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 47. [2018-11-18 10:59:16,810 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-11-18 10:59:16,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 55 transitions. [2018-11-18 10:59:16,810 INFO L728 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-18 10:59:16,810 INFO L608 BuchiCegarLoop]: Abstraction has 47 states and 55 transitions. [2018-11-18 10:59:16,810 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 10:59:16,811 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 47 states and 55 transitions. [2018-11-18 10:59:16,811 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:16,811 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:16,811 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:16,812 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:16,812 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:16,812 INFO L794 eck$LassoCheckResult]: Stem: 584#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 578#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 579#L554-2 assume true; 610#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 623#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 621#L551-4 main_#t~short9 := main_#t~short7; 593#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 594#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 585#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 586#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 602#L554-2 [2018-11-18 10:59:16,812 INFO L796 eck$LassoCheckResult]: Loop: 602#L554-2 assume true; 618#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 617#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 616#L551-4 main_#t~short9 := main_#t~short7; 615#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 614#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 613#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 602#L554-2 [2018-11-18 10:59:16,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash -410535018, now seen corresponding path program 1 times [2018-11-18 10:59:16,813 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,814 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:16,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:16,829 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,829 INFO L82 PathProgramCache]: Analyzing trace with hash -1282445234, now seen corresponding path program 2 times [2018-11-18 10:59:16,829 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:16,829 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,830 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:16,830 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:16,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:16,839 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:16,840 INFO L82 PathProgramCache]: Analyzing trace with hash -2013367527, now seen corresponding path program 1 times [2018-11-18 10:59:16,840 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:16,840 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:16,840 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,840 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:59:16,841 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:16,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:16,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,174 WARN L180 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 93 [2018-11-18 10:59:17,239 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:59:17,239 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:59:17,240 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:59:17,240 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:59:17,240 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:59:17,240 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:17,240 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:59:17,240 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:59:17,240 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-11-18 10:59:17,240 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:59:17,240 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:59:17,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,244 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,246 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,250 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,253 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,254 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,257 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,450 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,451 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,452 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:17,678 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:59:17,678 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:59:17,679 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,679 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,679 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,680 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,680 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,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-18 10:59:17,681 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,681 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,682 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,683 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,683 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,683 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,684 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,684 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,684 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,684 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,684 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,684 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,685 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,685 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,685 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,685 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,686 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,686 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,687 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,687 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,689 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,689 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,690 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,690 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,690 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,690 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,690 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,690 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,691 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,692 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,692 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,693 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,693 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,693 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,694 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,694 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,695 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,696 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,696 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,696 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,696 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,696 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,696 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,697 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,697 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,699 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,699 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,699 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,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-18 10:59:17,700 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,700 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,700 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,700 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,700 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,701 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,702 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,702 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,702 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,704 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,704 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,705 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,705 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,707 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,707 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,707 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,708 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,709 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,710 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:17,710 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,710 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,711 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:17,711 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,717 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,717 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,723 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,723 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,727 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:17,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,727 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,728 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:17,728 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,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-18 10:59:17,732 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,732 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,733 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,733 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,733 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,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-18 10:59:17,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,736 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,737 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,737 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,743 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,744 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,744 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,745 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,746 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:17,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,746 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,746 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:17,746 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:17,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:17,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:17,750 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:17,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:17,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:17,750 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:17,751 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:17,751 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:17,758 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:59:17,761 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:59:17,761 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:59:17,761 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:59:17,762 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:59:17,762 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:59:17,762 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_3 Supporting invariants [] [2018-11-18 10:59:17,828 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 10:59:17,829 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:59:17,837 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:17,851 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:17,870 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:17,870 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-18 10:59:17,870 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 12 Second operand 5 states. [2018-11-18 10:59:17,889 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 47 states and 55 transitions. cyclomatic complexity: 12. Second operand 5 states. Result 63 states and 74 transitions. Complement of second has 9 states. [2018-11-18 10:59:17,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:17,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:59:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-18 10:59:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 7 letters. [2018-11-18 10:59:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 17 letters. Loop has 7 letters. [2018-11-18 10:59:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 10 letters. Loop has 14 letters. [2018-11-18 10:59:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:17,891 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 63 states and 74 transitions. [2018-11-18 10:59:17,892 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:17,893 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 63 states to 62 states and 73 transitions. [2018-11-18 10:59:17,893 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 10:59:17,893 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 34 [2018-11-18 10:59:17,893 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 73 transitions. [2018-11-18 10:59:17,893 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:59:17,893 INFO L705 BuchiCegarLoop]: Abstraction has 62 states and 73 transitions. [2018-11-18 10:59:17,893 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states and 73 transitions. [2018-11-18 10:59:17,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-18 10:59:17,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-18 10:59:17,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 71 transitions. [2018-11-18 10:59:17,896 INFO L728 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-18 10:59:17,897 INFO L608 BuchiCegarLoop]: Abstraction has 61 states and 71 transitions. [2018-11-18 10:59:17,897 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 10:59:17,897 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 61 states and 71 transitions. [2018-11-18 10:59:17,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 15 [2018-11-18 10:59:17,897 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:17,897 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:17,897 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-11-18 10:59:17,898 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:17,898 INFO L794 eck$LassoCheckResult]: Stem: 865#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 863#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 864#L554-2 assume true; 907#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 906#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 905#L551-4 main_#t~short9 := main_#t~short7; 904#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 903#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 902#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 900#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 888#L554-2 assume true; 898#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 896#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 897#L551-4 main_#t~short9 := main_#t~short7; 892#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 893#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 912#L552 [2018-11-18 10:59:17,898 INFO L796 eck$LassoCheckResult]: Loop: 912#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 913#L554-2 assume true; 919#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 917#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 916#L551-4 main_#t~short9 := main_#t~short7; 915#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 914#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 912#L552 [2018-11-18 10:59:17,898 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,898 INFO L82 PathProgramCache]: Analyzing trace with hash -1285765374, now seen corresponding path program 2 times [2018-11-18 10:59:17,898 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:17,898 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,899 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:17,899 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,916 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,917 INFO L82 PathProgramCache]: Analyzing trace with hash 1890119082, now seen corresponding path program 3 times [2018-11-18 10:59:17,917 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:17,917 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:17,917 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,918 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:59:17,918 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,928 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:17,928 INFO L82 PathProgramCache]: Analyzing trace with hash -275811447, now seen corresponding path program 1 times [2018-11-18 10:59:17,928 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:17,928 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,929 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:59:17,929 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:17,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:17,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:18,063 WARN L180 SmtUtils]: Spent 108.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2018-11-18 10:59:18,333 WARN L180 SmtUtils]: Spent 242.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 108 [2018-11-18 10:59:18,385 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:59:18,385 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:59:18,385 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:59:18,385 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:59:18,386 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:59:18,386 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:18,386 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:59:18,386 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:59:18,386 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-11-18 10:59:18,386 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:59:18,386 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:59:18,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,406 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,407 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,409 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,410 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,413 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,415 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,610 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,614 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,616 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:18,862 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:59:18,862 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:59:18,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,863 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,863 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,863 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,863 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,868 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,868 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,868 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,868 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,869 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,869 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,869 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,869 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,869 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,870 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,877 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,877 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,877 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,879 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,879 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,879 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,881 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,881 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,881 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,882 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,882 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,882 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,882 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,882 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,883 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,884 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,884 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,884 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,884 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,884 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,885 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,885 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,885 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,886 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,887 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,887 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,887 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,887 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,887 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,889 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,889 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,889 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,890 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,890 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,890 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,891 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:18,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,891 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,891 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:18,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:18,892 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,893 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,893 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,893 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,895 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,895 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,896 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,898 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,899 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,899 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,899 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,899 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,899 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,899 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,901 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,901 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:18,901 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,901 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,902 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:18,902 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,904 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,905 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,905 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,905 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,906 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,906 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,908 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,909 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,909 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,909 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,909 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,910 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,910 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,914 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,914 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,914 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,914 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,914 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,914 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,915 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,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-18 10:59:18,916 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,916 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,916 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,916 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,917 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,917 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,919 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,920 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,920 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,920 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:18,923 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:18,923 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:18,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:18,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:18,924 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:18,924 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:18,924 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:18,928 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:59:18,933 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 10:59:18,933 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 10:59:18,934 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:59:18,934 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:59:18,934 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:59:18,935 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_4 Supporting invariants [] [2018-11-18 10:59:18,994 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 10:59:18,995 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:59:19,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,021 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,024 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,025 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:59:19,027 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,028 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 28 treesize of output 19 [2018-11-18 10:59:19,029 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,031 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,032 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,032 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:59:19,056 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:19,057 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:59:19,057 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 10:59:19,089 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 86 states and 99 transitions. Complement of second has 9 states. [2018-11-18 10:59:19,089 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:19,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:59:19,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 18 transitions. [2018-11-18 10:59:19,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 18 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 10:59:19,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:19,090 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:59:19,097 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,107 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,113 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,116 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,116 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:59:19,124 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,125 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 28 treesize of output 19 [2018-11-18 10:59:19,126 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,128 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,129 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,129 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:59:19,154 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:19,154 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:59:19,154 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 10:59:19,184 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 84 states and 95 transitions. Complement of second has 11 states. [2018-11-18 10:59:19,185 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:59:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 16 transitions. [2018-11-18 10:59:19,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 16 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 10:59:19,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:19,185 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 10:59:19,193 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,209 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:19,218 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:19,220 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,221 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 28 [2018-11-18 10:59:19,223 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:19,224 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 28 treesize of output 19 [2018-11-18 10:59:19,224 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,227 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,228 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:19,228 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-11-18 10:59:19,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:19,252 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-18 10:59:19,252 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-11-18 10:59:19,282 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 61 states and 71 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 138 states and 162 transitions. Complement of second has 10 states. [2018-11-18 10:59:19,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 10:59:19,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 10:59:19,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 23 transitions. [2018-11-18 10:59:19,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 7 letters. [2018-11-18 10:59:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:19,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 23 letters. Loop has 7 letters. [2018-11-18 10:59:19,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:19,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 23 transitions. Stem has 16 letters. Loop has 14 letters. [2018-11-18 10:59:19,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 10:59:19,286 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 138 states and 162 transitions. [2018-11-18 10:59:19,291 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-18 10:59:19,292 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 138 states to 103 states and 116 transitions. [2018-11-18 10:59:19,292 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 10:59:19,292 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 44 [2018-11-18 10:59:19,292 INFO L73 IsDeterministic]: Start isDeterministic. Operand 103 states and 116 transitions. [2018-11-18 10:59:19,292 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 10:59:19,292 INFO L705 BuchiCegarLoop]: Abstraction has 103 states and 116 transitions. [2018-11-18 10:59:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states and 116 transitions. [2018-11-18 10:59:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 76. [2018-11-18 10:59:19,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-18 10:59:19,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 89 transitions. [2018-11-18 10:59:19,298 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-11-18 10:59:19,298 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 89 transitions. [2018-11-18 10:59:19,298 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 10:59:19,298 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 89 transitions. [2018-11-18 10:59:19,299 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 18 [2018-11-18 10:59:19,299 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 10:59:19,299 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 10:59:19,299 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-18 10:59:19,299 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1, 1] [2018-11-18 10:59:19,300 INFO L794 eck$LassoCheckResult]: Stem: 1602#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1596#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 1597#L554-2 assume true; 1655#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1654#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1653#L551-4 main_#t~short9 := main_#t~short7; 1652#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1651#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1608#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1609#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 1603#L554-2 assume true; 1605#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1614#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1598#L551-4 main_#t~short9 := main_#t~short7; 1599#L551-5 [2018-11-18 10:59:19,300 INFO L796 eck$LassoCheckResult]: Loop: 1599#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1612#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1617#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1622#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 1640#L554-2 assume true; 1662#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1661#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1660#L551-4 main_#t~short9 := main_#t~short7; 1659#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 1658#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 1657#L552 assume 0 != main_#t~nondet10;havoc main_#t~nondet10;call main_#t~mem11 := read~int(main_~x~0.base, main_~x~0.offset, 4);call write~int(main_#t~mem11 - 1, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~mem11; 1606#L554-2 assume true; 1607#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1667#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 1666#L551-4 main_#t~short9 := main_#t~short7; 1599#L551-5 [2018-11-18 10:59:19,300 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,300 INFO L82 PathProgramCache]: Analyzing trace with hash 527882812, now seen corresponding path program 2 times [2018-11-18 10:59:19,300 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:19,300 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,301 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:19,301 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,324 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,324 INFO L82 PathProgramCache]: Analyzing trace with hash -2047910295, now seen corresponding path program 1 times [2018-11-18 10:59:19,324 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:19,324 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:19,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,325 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 10:59:19,325 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:19,342 INFO L82 PathProgramCache]: Analyzing trace with hash -12097842, now seen corresponding path program 1 times [2018-11-18 10:59:19,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 10:59:19,344 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 10:59:19,344 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,344 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 10:59:19,345 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 10:59:19,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 10:59:19,675 WARN L180 SmtUtils]: Spent 302.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-11-18 10:59:19,993 WARN L180 SmtUtils]: Spent 247.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2018-11-18 10:59:20,059 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 10:59:20,059 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 10:59:20,059 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 10:59:20,060 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 10:59:20,060 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 10:59:20,060 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 10:59:20,060 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 10:59:20,060 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 10:59:20,060 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-11-18 10:59:20,060 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 10:59:20,060 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 10:59:20,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,278 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,281 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,287 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,291 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,302 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 10:59:20,561 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 10:59:20,561 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 10:59:20,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 10:59:20,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,562 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 10:59:20,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 10:59:20,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,563 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,563 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,564 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,565 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,565 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,565 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,565 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,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-18 10:59:20,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,566 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:20,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,567 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:20,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,570 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 10:59:20,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,570 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 10:59:20,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,576 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,577 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,577 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,577 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,578 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,580 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,580 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,581 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,581 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,581 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,585 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,588 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,589 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,590 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,590 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 10:59:20,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 10:59:20,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 10:59:20,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 10:59:20,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 10:59:20,599 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 10:59:20,600 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 10:59:20,600 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 10:59:20,607 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 10:59:20,609 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 10:59:20,609 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 10:59:20,610 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 10:59:20,611 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 10:59:20,611 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 10:59:20,611 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2018-11-18 10:59:20,671 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 10:59:20,673 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 10:59:20,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 10:59:20,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:20,692 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:20,694 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 10:59:20,698 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:20,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:20,699 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 10:59:20,700 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,702 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,704 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,704 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 10:59:20,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 10:59:20,713 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 10:59:20,720 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:20,728 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-18 10:59:20,734 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:20,735 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 45 treesize of output 38 [2018-11-18 10:59:20,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,764 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:20,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-11-18 10:59:20,773 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 10:59:20,806 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-18 10:59:20,808 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:59:20,808 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,813 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,817 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 10:59:20,818 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:59:20,818 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,823 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,851 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-18 10:59:20,852 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 10:59:20,852 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,856 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:20,883 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:59:20,897 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 10:59:20,898 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-11-18 10:59:21,133 WARN L180 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 69 DAG size of output: 43 [2018-11-18 10:59:21,181 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,183 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 43 [2018-11-18 10:59:21,187 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,188 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 28 treesize of output 19 [2018-11-18 10:59:21,188 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,195 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,236 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 58 [2018-11-18 10:59:21,251 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,252 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 47 treesize of output 38 [2018-11-18 10:59:21,253 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,282 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,283 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 41 [2018-11-18 10:59:21,283 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,296 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:59:21,316 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,324 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 56 [2018-11-18 10:59:21,327 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,327 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 45 treesize of output 36 [2018-11-18 10:59:21,328 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,342 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 10:59:21,342 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 32 treesize of output 31 [2018-11-18 10:59:21,343 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 10:59:21,354 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 10:59:21,371 INFO L267 ElimStorePlain]: Start of recursive call 1: 5 dim-0 vars, 3 dim-2 vars, End of recursive call: 5 dim-0 vars, and 4 xjuncts. [2018-11-18 10:59:21,372 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-11-18 10:59:21,614 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2018-11-18 10:59:21,659 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 10:59:21,659 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2018-11-18 10:59:21,660 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18 Second operand 11 states. [2018-11-18 11:00:47,101 WARN L180 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 85 DAG size of output: 79 [2018-11-18 11:00:47,263 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2018-11-18 11:02:11,329 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 138 states and 159 transitions. Complement of second has 16 states. [2018-11-18 11:02:11,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 2 stem states 6 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:11,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-18 11:02:11,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 20 transitions. [2018-11-18 11:02:11,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 20 transitions. Stem has 14 letters. Loop has 15 letters. [2018-11-18 11:02:11,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:11,330 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:11,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:11,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:11,352 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:11,359 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:11,367 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,368 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,369 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:11,369 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,371 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,373 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,374 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:11,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:11,383 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:11,390 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,398 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-18 11:02:11,404 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,412 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 42 treesize of output 52 [2018-11-18 11:02:11,413 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-18 11:02:11,453 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,453 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 35 treesize of output 38 [2018-11-18 11:02:11,454 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,488 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 11:02:11,490 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,490 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,495 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,499 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-18 11:02:11,501 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,501 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,506 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,532 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,534 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,546 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 61 [2018-11-18 11:02:11,548 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 51 [2018-11-18 11:02:11,549 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,570 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:02:11,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-18 11:02:11,603 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,603 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,607 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,623 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:11,637 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:02:11,637 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-11-18 11:02:11,643 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-11-18 11:02:11,646 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,646 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 19 [2018-11-18 11:02:11,646 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,647 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,650 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,650 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-11-18 11:02:11,678 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:02:11,679 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 11:02:11,679 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-18 11:02:11,723 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 121 states and 140 transitions. Complement of second has 12 states. [2018-11-18 11:02:11,727 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:11,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:02:11,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-11-18 11:02:11,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 14 letters. Loop has 15 letters. [2018-11-18 11:02:11,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:11,727 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:11,746 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:11,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:11,755 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:11,757 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,761 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,762 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:11,762 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,764 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,767 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,767 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:11,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:11,776 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:11,784 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,793 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 47 treesize of output 56 [2018-11-18 11:02:11,797 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,797 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 45 treesize of output 38 [2018-11-18 11:02:11,797 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,823 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,831 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 32 treesize of output 52 [2018-11-18 11:02:11,832 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-11-18 11:02:11,867 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,870 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:11,881 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 35 treesize of output 61 [2018-11-18 11:02:11,884 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 43 [2018-11-18 11:02:11,884 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,902 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:02:11,939 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 24 [2018-11-18 11:02:11,941 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,941 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,945 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,971 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 27 [2018-11-18 11:02:11,973 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,973 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,978 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,982 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 28 [2018-11-18 11:02:11,984 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:11,984 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:11,989 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:12,004 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:12,023 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-18 11:02:12,024 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-11-18 11:02:12,032 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:12,033 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 25 treesize of output 28 [2018-11-18 11:02:12,038 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:12,039 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 28 treesize of output 19 [2018-11-18 11:02:12,039 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:12,041 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:12,044 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:12,044 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-11-18 11:02:12,091 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2018-11-18 11:02:12,092 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 11:02:12,092 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18 Second operand 7 states. [2018-11-18 11:02:12,144 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 89 transitions. cyclomatic complexity: 18. Second operand 7 states. Result 164 states and 190 transitions. Complement of second has 12 states. [2018-11-18 11:02:12,144 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:12,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:02:12,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 27 transitions. [2018-11-18 11:02:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 14 letters. Loop has 15 letters. [2018-11-18 11:02:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:12,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 29 letters. Loop has 15 letters. [2018-11-18 11:02:12,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:12,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 27 transitions. Stem has 14 letters. Loop has 30 letters. [2018-11-18 11:02:12,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:12,146 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 164 states and 190 transitions. [2018-11-18 11:02:12,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 34 [2018-11-18 11:02:12,148 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 164 states to 126 states and 146 transitions. [2018-11-18 11:02:12,148 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 34 [2018-11-18 11:02:12,148 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2018-11-18 11:02:12,148 INFO L73 IsDeterministic]: Start isDeterministic. Operand 126 states and 146 transitions. [2018-11-18 11:02:12,148 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:02:12,148 INFO L705 BuchiCegarLoop]: Abstraction has 126 states and 146 transitions. [2018-11-18 11:02:12,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states and 146 transitions. [2018-11-18 11:02:12,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 106. [2018-11-18 11:02:12,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-18 11:02:12,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 126 transitions. [2018-11-18 11:02:12,151 INFO L728 BuchiCegarLoop]: Abstraction has 106 states and 126 transitions. [2018-11-18 11:02:12,151 INFO L608 BuchiCegarLoop]: Abstraction has 106 states and 126 transitions. [2018-11-18 11:02:12,151 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:02:12,151 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 106 states and 126 transitions. [2018-11-18 11:02:12,152 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 31 [2018-11-18 11:02:12,152 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:02:12,152 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:02:12,152 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 11:02:12,152 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:12,152 INFO L794 eck$LassoCheckResult]: Stem: 2547#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2545#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2546#L554-2 assume true; 2628#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2626#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2623#L551-4 main_#t~short9 := main_#t~short7; 2624#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2560#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 2556#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2557#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 2571#L554-2 assume true; 2647#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2645#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2644#L551-4 main_#t~short9 := main_#t~short7; 2618#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2595#L551-7 [2018-11-18 11:02:12,153 INFO L796 eck$LassoCheckResult]: Loop: 2595#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 2574#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2575#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 2576#L554-2 assume true; 2638#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2637#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 2636#L551-4 main_#t~short9 := main_#t~short7; 2617#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 2595#L551-7 [2018-11-18 11:02:12,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:12,153 INFO L82 PathProgramCache]: Analyzing trace with hash -815501994, now seen corresponding path program 3 times [2018-11-18 11:02:12,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:12,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,154 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:12,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,167 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:12,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1017034032, now seen corresponding path program 2 times [2018-11-18 11:02:12,167 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:12,167 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,168 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:12,168 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,175 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:12,176 INFO L82 PathProgramCache]: Analyzing trace with hash 1287754533, now seen corresponding path program 1 times [2018-11-18 11:02:12,176 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:12,176 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:12,176 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,177 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:12,177 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:12,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:12,345 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2018-11-18 11:02:12,456 WARN L180 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2018-11-18 11:02:12,764 WARN L180 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-11-18 11:02:13,209 WARN L180 SmtUtils]: Spent 437.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-18 11:02:13,212 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:02:13,212 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:02:13,212 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:02:13,212 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:02:13,212 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:02:13,212 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:02:13,212 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:02:13,212 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:02:13,212 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-11-18 11:02:13,212 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:02:13,212 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:02:13,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,222 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,231 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,233 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,590 WARN L180 SmtUtils]: Spent 293.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-11-18 11:02:13,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-18 11:02:13,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,684 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,685 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,687 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:13,688 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:14,026 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:02:14,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:02:14,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,028 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,030 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,033 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,033 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,034 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,034 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,034 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,034 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,034 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,034 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,036 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,036 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:14,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,037 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:14,037 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,040 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:14,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,041 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:14,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,044 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,045 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,048 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,051 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,051 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,053 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,053 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,061 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,062 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,062 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:14,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:14,065 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:14,065 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:14,065 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:14,065 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:14,066 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:14,066 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:14,069 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:02:14,073 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-18 11:02:14,074 INFO L444 ModelExtractionUtils]: 6 out of 10 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:02:14,074 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:02:14,074 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:02:14,075 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:02:14,075 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2018-11-18 11:02:14,165 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 11:02:14,167 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:14,180 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,190 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,192 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:14,197 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,198 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,199 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:14,199 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,202 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,219 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,219 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:14,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,230 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,232 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 11:02:14,234 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,235 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 28 treesize of output 19 [2018-11-18 11:02:14,236 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,244 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:14,246 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:14,246 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,249 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,252 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,255 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,255 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-18 11:02:14,291 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:14,291 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 11:02:14,291 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-18 11:02:14,358 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 206 states and 247 transitions. Complement of second has 12 states. [2018-11-18 11:02:14,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:14,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:02:14,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-18 11:02:14,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 11:02:14,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:14,361 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:14,377 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,388 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,399 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,400 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:14,400 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,402 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,405 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,405 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:14,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,420 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,425 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,426 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 11:02:14,430 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,431 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 28 treesize of output 19 [2018-11-18 11:02:14,432 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,441 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:14,443 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:14,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,449 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,453 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,456 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,457 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-18 11:02:14,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:14,494 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 11:02:14,494 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-18 11:02:14,562 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 206 states and 247 transitions. Complement of second has 12 states. [2018-11-18 11:02:14,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:14,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:02:14,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-11-18 11:02:14,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 11:02:14,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:14,566 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:14,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,599 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:14,606 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,607 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,608 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:14,608 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,610 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,613 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,613 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:14,619 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:14,620 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:14,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,624 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 11:02:14,626 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:14,627 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 28 treesize of output 19 [2018-11-18 11:02:14,627 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,635 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:14,636 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:14,637 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,641 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,644 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,648 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:14,648 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-11-18 11:02:14,688 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:14,688 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2018-11-18 11:02:14,688 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-18 11:02:14,760 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 106 states and 126 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 270 states and 324 transitions. Complement of second has 13 states. [2018-11-18 11:02:14,760 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:14,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-11-18 11:02:14,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 28 transitions. [2018-11-18 11:02:14,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 11:02:14,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:14,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-18 11:02:14,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:14,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 28 transitions. Stem has 15 letters. Loop has 16 letters. [2018-11-18 11:02:14,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:14,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 270 states and 324 transitions. [2018-11-18 11:02:14,763 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 46 [2018-11-18 11:02:14,765 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 270 states to 208 states and 244 transitions. [2018-11-18 11:02:14,765 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2018-11-18 11:02:14,765 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 41 [2018-11-18 11:02:14,765 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 244 transitions. [2018-11-18 11:02:14,765 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:02:14,765 INFO L705 BuchiCegarLoop]: Abstraction has 208 states and 244 transitions. [2018-11-18 11:02:14,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 244 transitions. [2018-11-18 11:02:14,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 166. [2018-11-18 11:02:14,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 166 states. [2018-11-18 11:02:14,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 197 transitions. [2018-11-18 11:02:14,771 INFO L728 BuchiCegarLoop]: Abstraction has 166 states and 197 transitions. [2018-11-18 11:02:14,771 INFO L608 BuchiCegarLoop]: Abstraction has 166 states and 197 transitions. [2018-11-18 11:02:14,771 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:02:14,771 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 166 states and 197 transitions. [2018-11-18 11:02:14,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-18 11:02:14,772 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:02:14,772 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:02:14,772 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-11-18 11:02:14,772 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:14,772 INFO L794 eck$LassoCheckResult]: Stem: 3728#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3721#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3722#L554-2 assume true; 3733#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3746#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3747#L551-4 main_#t~short9 := main_#t~short7; 3764#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3760#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3729#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3730#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3749#L554-2 assume true; 3800#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3797#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3795#L551-4 main_#t~short9 := main_#t~short7; 3761#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3762#L551-7 [2018-11-18 11:02:14,772 INFO L796 eck$LassoCheckResult]: Loop: 3762#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 3784#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3783#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 3782#L554-2 assume true; 3781#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3780#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 3779#L551-4 main_#t~short9 := main_#t~short7; 3777#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 3762#L551-7 [2018-11-18 11:02:14,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,773 INFO L82 PathProgramCache]: Analyzing trace with hash -815501994, now seen corresponding path program 4 times [2018-11-18 11:02:14,773 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:14,773 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:14,773 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:14,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,786 INFO L82 PathProgramCache]: Analyzing trace with hash -959775730, now seen corresponding path program 1 times [2018-11-18 11:02:14,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:14,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:14,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,788 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:14,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:14,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1345012835, now seen corresponding path program 5 times [2018-11-18 11:02:14,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:14,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:14,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:14,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:14,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:14,966 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-18 11:02:15,374 WARN L180 SmtUtils]: Spent 309.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-11-18 11:02:15,832 WARN L180 SmtUtils]: Spent 451.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-11-18 11:02:15,834 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:02:15,834 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:02:15,834 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:02:15,834 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:02:15,834 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:02:15,834 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:02:15,835 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:02:15,835 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:02:15,835 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-11-18 11:02:15,835 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:02:15,835 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:02:15,839 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:15,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,198 WARN L180 SmtUtils]: Spent 287.00 ms on a formula simplification. DAG size of input: 90 DAG size of output: 78 [2018-11-18 11:02:16,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,294 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,295 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,297 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,303 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,305 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:16,640 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:02:16,640 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:02:16,640 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,641 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,643 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,643 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,650 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,650 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,651 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,651 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,651 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,651 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,651 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:16,652 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,655 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,655 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,658 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,658 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,659 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,662 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,663 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,663 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,671 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,671 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,672 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:16,672 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,674 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,675 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,675 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,675 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,675 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,678 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,678 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:16,678 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,680 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:16,681 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,698 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,698 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,698 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:16,698 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,701 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,702 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,702 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,703 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,703 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,703 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,704 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,706 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,706 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,707 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,708 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,708 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,708 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,709 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,709 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,709 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,709 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,709 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,709 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,710 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,710 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,711 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,711 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,711 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,712 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,712 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,712 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,712 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,713 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,713 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,714 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,714 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,714 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,715 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,716 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,716 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,716 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,716 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,716 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,716 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,716 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,717 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,718 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,718 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,719 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,719 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,720 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,720 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,720 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,720 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,720 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,720 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,721 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,722 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,722 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:16,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,723 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:16,724 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:16,724 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:16,725 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,725 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:02:16,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,726 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,726 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,726 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,726 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,726 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,728 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,728 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,729 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,729 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,733 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,734 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,734 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,734 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,738 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,738 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,738 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,739 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,739 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,743 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,744 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,744 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,748 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,749 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,749 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,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-18 11:02:16,752 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,753 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,753 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,753 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,755 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,755 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,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-18 11:02:16,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,766 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,766 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,767 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,767 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,770 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,771 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,771 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,774 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,775 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,775 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:16,775 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,778 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-18 11:02:16,778 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 11:02:16,805 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,805 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,806 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,806 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,806 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,806 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,807 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,807 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,810 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,810 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,810 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,811 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,811 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,812 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,812 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,812 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,812 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,812 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,813 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,813 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,815 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,815 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,815 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,815 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,816 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,816 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,817 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,817 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,817 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,818 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,818 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,819 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,819 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,820 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,820 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,820 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,820 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,820 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,820 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,820 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,821 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,822 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,822 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,822 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,823 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,823 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,823 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,824 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,824 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,825 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,825 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,825 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,825 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,825 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,825 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,826 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,826 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,827 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,827 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,827 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,829 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,830 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,830 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,830 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,830 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,830 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,830 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,832 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,832 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:16,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,833 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:16,834 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:16,834 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:16,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,835 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:02:16,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,837 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,837 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,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-18 11:02:16,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,840 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,840 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,846 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,847 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,847 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,851 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,851 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,852 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:16,852 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,856 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,857 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,858 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,863 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,863 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,867 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,867 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,870 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,870 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,883 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,883 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,883 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,884 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:16,884 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,888 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,889 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,889 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,889 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,889 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,894 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,894 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:16,894 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,897 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-18 11:02:16,897 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 11:02:16,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,920 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,920 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,920 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,921 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,921 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:16,921 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,925 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,925 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,925 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,926 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,926 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,926 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,926 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,926 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,928 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,928 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,928 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,929 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,929 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,929 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,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-18 11:02:16,932 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,932 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,932 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,933 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,934 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,934 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,935 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,935 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,936 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,936 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,937 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,938 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,938 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,939 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,940 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,940 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,940 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,940 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,940 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,941 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,941 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,942 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,942 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,943 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,943 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,944 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,944 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,945 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,945 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,945 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,945 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,945 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,945 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,946 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,946 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,947 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,948 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,950 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,951 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,951 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,951 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,951 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,952 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,952 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:16,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,953 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,953 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:16,953 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:16,954 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,954 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,954 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,954 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,955 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,955 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:16,955 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:16,955 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:16,957 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,957 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:02:16,958 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,958 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,958 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,958 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,958 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,959 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:16,959 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,960 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,961 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,961 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,961 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,963 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:16,963 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,970 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,970 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,972 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:16,972 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,977 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,977 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:16,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,978 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,979 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:16,979 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,983 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,984 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,984 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,985 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:16,986 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:16,993 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:16,993 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:16,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:16,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:16,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:16,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:16,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:16,999 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,002 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,002 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,018 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,018 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,019 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:17,020 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,025 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,026 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,026 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,031 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,032 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:17,032 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,036 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-11-18 11:02:17,036 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-18 11:02:17,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,091 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,091 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,092 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:17,092 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,099 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,099 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,101 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,102 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,102 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,105 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,105 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,105 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,106 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,106 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,108 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,109 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,110 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,110 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,112 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,112 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,116 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,116 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,118 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,119 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,121 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,121 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,125 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,126 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,127 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:17,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,128 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,128 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:17,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:17,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:17,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,129 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:17,130 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:17,130 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:17,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,133 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:02:17,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,133 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,133 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,134 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,134 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,134 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,137 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,137 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,137 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,138 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,138 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,145 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,145 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,145 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,145 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,146 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,146 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,147 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,147 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,151 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,152 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:17,152 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,158 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,158 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,164 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,164 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,168 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,171 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,171 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,183 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,184 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,184 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,184 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,184 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,184 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,185 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:17,185 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,189 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,189 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:17,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:17,189 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,190 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:17,190 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:17,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:17,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:17,195 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:17,195 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:17,195 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:17,195 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:17,195 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:17,198 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-18 11:02:17,198 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 11:02:17,237 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:02:17,275 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 11:02:17,275 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-11-18 11:02:17,275 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:02:17,276 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-18 11:02:17,277 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:02:17,277 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_7 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_7 Supporting invariants [] [2018-11-18 11:02:17,566 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 11:02:17,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:17,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:17,568 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:17,585 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:17,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:17,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:17,596 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:17,600 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,601 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,601 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:17,601 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,604 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,606 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,606 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:17,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:17,616 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:17,648 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,648 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:17,651 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,651 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 28 treesize of output 19 [2018-11-18 11:02:17,651 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,660 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:17,662 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:17,662 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,666 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,710 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,710 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:17,713 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,713 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 28 treesize of output 19 [2018-11-18 11:02:17,713 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,722 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:17,723 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:17,724 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,727 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-18 11:02:17,759 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:17,759 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 33 treesize of output 22 [2018-11-18 11:02:17,760 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 11:02:17,776 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:17,776 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,782 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,787 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:17,824 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:17,824 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-18 11:02:17,851 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:17,851 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 11:02:17,852 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 166 states and 197 transitions. cyclomatic complexity: 40 Second operand 5 states. [2018-11-18 11:02:18,004 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 166 states and 197 transitions. cyclomatic complexity: 40. Second operand 5 states. Result 357 states and 415 transitions. Complement of second has 8 states. [2018-11-18 11:02:18,005 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:18,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:02:18,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-18 11:02:18,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 8 letters. [2018-11-18 11:02:18,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:18,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-18 11:02:18,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:18,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 15 letters. Loop has 16 letters. [2018-11-18 11:02:18,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:18,006 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 357 states and 415 transitions. [2018-11-18 11:02:18,008 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-18 11:02:18,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 357 states to 253 states and 297 transitions. [2018-11-18 11:02:18,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 36 [2018-11-18 11:02:18,010 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-11-18 11:02:18,010 INFO L73 IsDeterministic]: Start isDeterministic. Operand 253 states and 297 transitions. [2018-11-18 11:02:18,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:02:18,010 INFO L705 BuchiCegarLoop]: Abstraction has 253 states and 297 transitions. [2018-11-18 11:02:18,010 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 253 states and 297 transitions. [2018-11-18 11:02:18,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 253 to 208. [2018-11-18 11:02:18,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 208 states. [2018-11-18 11:02:18,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 247 transitions. [2018-11-18 11:02:18,017 INFO L728 BuchiCegarLoop]: Abstraction has 208 states and 247 transitions. [2018-11-18 11:02:18,017 INFO L608 BuchiCegarLoop]: Abstraction has 208 states and 247 transitions. [2018-11-18 11:02:18,017 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:02:18,017 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 208 states and 247 transitions. [2018-11-18 11:02:18,018 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 45 [2018-11-18 11:02:18,018 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:02:18,018 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:02:18,019 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-11-18 11:02:18,019 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:02:18,019 INFO L794 eck$LassoCheckResult]: Stem: 4450#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4444#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 4445#L554-2 assume true; 4485#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4484#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4483#L551-4 main_#t~short9 := main_#t~short7; 4481#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4467#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4469#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4497#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 4498#L554-2 assume true; 4493#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4494#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4489#L551-4 main_#t~short9 := main_#t~short7; 4490#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4478#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4474#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4475#L554-2 assume true; 4518#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4471#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4472#L551-4 main_#t~short9 := main_#t~short7; 4499#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4500#L551-7 [2018-11-18 11:02:18,019 INFO L796 eck$LassoCheckResult]: Loop: 4500#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 4451#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4452#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 4455#L554-2 assume true; 4456#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4501#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 4446#L551-4 main_#t~short9 := main_#t~short7; 4447#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 4500#L551-7 [2018-11-18 11:02:18,019 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:18,019 INFO L82 PathProgramCache]: Analyzing trace with hash -1938837211, now seen corresponding path program 2 times [2018-11-18 11:02:18,019 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:18,020 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:18,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,020 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:18,020 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:18,044 INFO L82 PathProgramCache]: Analyzing trace with hash -959775730, now seen corresponding path program 2 times [2018-11-18 11:02:18,045 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:18,045 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,045 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:18,045 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,051 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:18,051 INFO L82 PathProgramCache]: Analyzing trace with hash -1634121422, now seen corresponding path program 3 times [2018-11-18 11:02:18,051 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:18,051 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,052 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:18,052 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:18,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:18,279 WARN L180 SmtUtils]: Spent 203.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-11-18 11:02:18,388 WARN L180 SmtUtils]: Spent 106.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2018-11-18 11:02:18,996 WARN L180 SmtUtils]: Spent 607.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 144 [2018-11-18 11:02:19,526 WARN L180 SmtUtils]: Spent 520.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2018-11-18 11:02:19,529 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:02:19,529 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:02:19,529 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:02:19,529 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:02:19,529 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:02:19,529 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:02:19,529 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:02:19,529 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:02:19,529 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-11-18 11:02:19,529 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:02:19,529 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:02:19,532 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:19,984 WARN L180 SmtUtils]: Spent 369.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-11-18 11:02:20,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,091 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,097 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,102 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:20,432 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:02:20,432 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:02:20,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,436 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,436 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,437 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,437 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:20,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,439 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,439 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,440 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,440 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,440 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,440 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,443 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,443 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,443 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,444 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,444 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:20,444 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,446 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,446 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,446 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,447 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,447 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,447 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,447 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,449 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,450 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,450 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,451 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,452 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,452 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,452 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,452 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:20,452 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,454 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:20,454 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,475 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,475 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,476 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,483 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,483 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,483 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,483 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,484 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,484 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,486 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,486 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,486 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,487 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:20,487 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,489 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,490 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,490 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,491 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,491 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,491 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,492 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,492 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,493 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,493 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,494 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,494 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,495 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,495 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,496 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,496 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,496 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,496 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,497 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,497 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,498 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,498 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,498 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,499 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,500 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,500 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,500 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,500 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,500 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,501 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,501 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,501 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,501 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,502 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,502 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,502 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,503 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,503 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,503 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,504 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,504 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,505 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,505 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,505 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,506 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,506 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,506 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,506 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,506 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,506 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,506 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,506 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,507 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,507 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,507 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:20,507 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,508 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,509 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,509 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:20,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:20,509 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:20,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,510 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:02:20,510 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,511 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,511 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,511 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,511 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,511 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,512 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,515 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,516 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,516 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,519 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,520 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,520 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,523 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,523 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,524 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,524 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,524 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,524 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,525 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,525 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,527 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,528 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,528 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,528 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,528 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,529 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,529 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,533 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,533 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,533 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,535 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,535 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:20,535 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,537 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-18 11:02:20,537 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 11:02:20,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,568 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,568 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,569 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,572 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,574 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,574 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,583 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,584 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,584 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,587 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,587 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,587 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,588 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,588 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,591 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,592 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,592 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,593 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,593 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,593 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,594 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,594 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,595 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,595 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,596 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,596 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,596 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,598 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,598 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,598 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,599 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,599 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,599 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,601 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,601 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,601 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,601 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,603 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,604 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,604 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,604 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,604 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,604 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,605 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,605 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,605 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,605 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,606 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,606 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,607 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,607 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,608 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,610 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,610 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,610 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,610 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,611 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,611 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,611 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,611 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,612 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,612 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,612 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,612 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,612 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:02:20,612 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,613 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,613 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,614 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,614 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,615 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:02:20,615 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,616 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,616 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,617 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,621 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,621 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:20,622 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,625 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,626 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,626 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,627 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,632 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,632 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,632 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,632 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:20,633 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,636 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,637 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,637 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,642 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,642 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,644 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,644 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,644 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,644 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:20,644 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,648 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-18 11:02:20,648 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-18 11:02:20,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,680 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,681 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,682 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,685 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,685 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,688 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,701 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,702 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,702 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,706 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,706 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,706 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,706 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,707 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-18 11:02:20,708 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,712 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,712 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,714 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,715 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,715 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,717 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,717 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,718 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,718 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,721 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,721 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,722 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,722 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,722 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,722 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,724 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,725 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,726 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,726 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,734 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,737 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,737 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,740 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,741 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,741 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,741 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,743 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,743 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,744 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,744 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,744 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,744 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,744 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:02:20,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,745 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,746 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,746 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,746 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,746 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:02:20,746 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,747 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-18 11:02:20,749 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,749 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:02:20,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-18 11:02:20,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,750 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,751 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,751 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,755 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,756 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,756 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:20,757 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,762 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,762 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,768 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,769 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:20,769 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,773 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,773 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,774 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,775 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,775 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,780 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,780 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,781 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,781 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,783 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:20,783 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,787 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-11-18 11:02:20,788 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-18 11:02:20,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,826 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,827 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,827 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,835 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,835 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,850 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,851 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,851 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,855 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,856 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,856 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-18 11:02:20,857 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,861 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,861 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,862 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,862 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,864 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,864 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,864 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,866 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,867 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,867 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,867 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,867 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,868 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,869 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,869 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,869 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,870 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,870 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,870 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,871 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,871 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,871 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,871 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,871 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,871 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,871 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,872 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,873 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,873 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,873 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,873 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,873 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,876 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,877 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,877 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,877 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,877 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,877 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,878 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,879 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,880 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,881 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,881 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,882 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,882 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,883 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,883 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,883 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,883 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,883 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,883 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,884 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,885 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,885 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,886 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,886 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:20,886 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,886 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,887 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:02:20,887 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:20,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:20,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,888 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:02:20,889 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-18 11:02:20,889 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-18 11:02:20,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,891 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:02:20,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,892 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,893 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,894 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,894 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,898 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,898 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,898 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,899 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,899 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,906 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,907 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,907 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,907 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,907 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,908 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,908 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,913 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,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-18 11:02:20,913 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,913 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,913 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,913 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,914 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,914 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:02:20,914 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,917 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,934 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,934 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,935 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,935 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,939 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,939 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:20,939 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:20,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,940 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-18 11:02:20,940 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-18 11:02:20,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:20,942 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:20,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:02:20,942 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:02:20,943 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:20,943 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:02:20,943 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:02:20,946 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-11-18 11:02:20,946 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-18 11:02:20,988 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:02:21,021 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-18 11:02:21,021 INFO L444 ModelExtractionUtils]: 27 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-11-18 11:02:21,021 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:02:21,022 INFO L440 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2018-11-18 11:02:21,023 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:02:21,023 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [] [2018-11-18 11:02:21,404 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 11:02:21,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:21,406 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:21,407 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:21,430 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,446 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:21,448 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:21,511 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,512 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,512 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:21,513 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,535 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,543 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:21,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,556 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:21,622 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,623 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:21,627 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,627 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 28 treesize of output 19 [2018-11-18 11:02:21,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,642 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:21,644 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:21,644 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,649 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,655 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,699 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,700 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-18 11:02:21,703 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,703 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 33 treesize of output 22 [2018-11-18 11:02:21,704 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,719 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 11:02:21,720 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:21,720 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,726 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,731 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,756 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,756 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:21,758 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,759 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 28 treesize of output 19 [2018-11-18 11:02:21,759 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,772 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:21,774 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:21,774 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,778 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,782 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,816 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:21,817 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-18 11:02:21,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:21,843 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 11:02:21,844 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-11-18 11:02:21,909 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 357 states and 415 transitions. Complement of second has 8 states. [2018-11-18 11:02:21,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:21,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:02:21,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-18 11:02:21,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-18 11:02:21,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:21,915 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:21,938 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:21,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,950 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:21,951 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,956 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:21,957 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:21,957 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,959 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,962 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:21,962 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:21,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:21,973 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:22,008 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-11-18 11:02:22,008 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,154 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,155 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:22,158 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,158 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 28 treesize of output 19 [2018-11-18 11:02:22,159 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,170 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:22,171 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,171 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,174 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,179 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,219 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,219 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-18 11:02:22,222 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,222 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 33 treesize of output 22 [2018-11-18 11:02:22,223 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,233 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 11:02:22,235 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,235 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,239 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,244 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,269 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,269 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:22,271 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,272 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 28 treesize of output 19 [2018-11-18 11:02:22,272 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,280 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:22,282 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,282 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,286 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,290 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,308 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:22,308 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-18 11:02:22,334 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:22,335 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 11:02:22,335 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-11-18 11:02:22,400 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 357 states and 415 transitions. Complement of second has 8 states. [2018-11-18 11:02:22,407 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:22,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:02:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 22 transitions. [2018-11-18 11:02:22,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 22 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-18 11:02:22,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:22,407 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-18 11:02:22,425 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:22,437 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:22,438 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 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 11 treesize of output 14 [2018-11-18 11:02:22,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,443 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,444 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 4 [2018-11-18 11:02:22,444 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,446 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,449 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,449 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-11-18 11:02:22,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:22,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:22,486 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,487 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:22,489 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,490 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 28 treesize of output 19 [2018-11-18 11:02:22,490 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,503 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:22,505 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,505 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,509 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,513 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,589 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,590 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 51 [2018-11-18 11:02:22,592 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,593 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 33 treesize of output 22 [2018-11-18 11:02:22,593 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,602 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 31 [2018-11-18 11:02:22,604 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,604 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,608 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,613 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,638 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,639 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 49 [2018-11-18 11:02:22,641 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:22,641 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 28 treesize of output 19 [2018-11-18 11:02:22,641 INFO L267 ElimStorePlain]: Start of recursive call 11: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,650 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:22,651 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:22,651 INFO L267 ElimStorePlain]: Start of recursive call 13: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,655 INFO L267 ElimStorePlain]: Start of recursive call 12: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,659 INFO L267 ElimStorePlain]: Start of recursive call 10: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:22,677 INFO L267 ElimStorePlain]: Start of recursive call 1: 8 dim-0 vars, 4 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-18 11:02:22,677 INFO L202 ElimStorePlain]: Needed 13 recursive calls to eliminate 12 variables, input treesize:244, output treesize:67 [2018-11-18 11:02:22,703 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:02:22,703 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-18 11:02:22,704 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50 Second operand 5 states. [2018-11-18 11:02:22,769 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 208 states and 247 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 423 states and 501 transitions. Complement of second has 9 states. [2018-11-18 11:02:22,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:22,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-18 11:02:22,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 28 transitions. [2018-11-18 11:02:22,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 23 letters. Loop has 8 letters. [2018-11-18 11:02:22,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:22,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 31 letters. Loop has 8 letters. [2018-11-18 11:02:22,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:22,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 28 transitions. Stem has 23 letters. Loop has 16 letters. [2018-11-18 11:02:22,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:22,770 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 423 states and 501 transitions. [2018-11-18 11:02:22,772 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 57 [2018-11-18 11:02:22,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 423 states to 226 states and 268 transitions. [2018-11-18 11:02:22,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 16 [2018-11-18 11:02:22,773 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 16 [2018-11-18 11:02:22,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 226 states and 268 transitions. [2018-11-18 11:02:22,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-18 11:02:22,773 INFO L705 BuchiCegarLoop]: Abstraction has 226 states and 268 transitions. [2018-11-18 11:02:22,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 226 states and 268 transitions. [2018-11-18 11:02:22,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 226 to 178. [2018-11-18 11:02:22,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178 states. [2018-11-18 11:02:22,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 211 transitions. [2018-11-18 11:02:22,784 INFO L728 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-18 11:02:22,784 INFO L608 BuchiCegarLoop]: Abstraction has 178 states and 211 transitions. [2018-11-18 11:02:22,784 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:02:22,784 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 178 states and 211 transitions. [2018-11-18 11:02:22,784 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 55 [2018-11-18 11:02:22,784 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:02:22,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:02:22,785 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-11-18 11:02:22,785 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 2, 1, 1] [2018-11-18 11:02:22,785 INFO L794 eck$LassoCheckResult]: Stem: 6234#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6228#L-1 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~nondet10, main_#t~mem11, main_#t~nondet12, main_#t~mem13, main_#t~nondet14, main_#t~mem15, main_#t~nondet16, main_#t~mem5, main_#t~mem6, main_#t~short7, main_#t~mem8, main_#t~short9, main_~x~0.base, main_~x~0.offset, main_~y~0.base, main_~y~0.offset, main_~z~0.base, main_~z~0.offset;call main_#t~malloc2.base, main_#t~malloc2.offset := #Ultimate.alloc(4);main_~x~0.base, main_~x~0.offset := main_#t~malloc2.base, main_#t~malloc2.offset;call main_#t~malloc3.base, main_#t~malloc3.offset := #Ultimate.alloc(4);main_~y~0.base, main_~y~0.offset := main_#t~malloc3.base, main_#t~malloc3.offset;call main_#t~malloc4.base, main_#t~malloc4.offset := #Ultimate.alloc(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 6229#L554-2 assume true; 6239#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6254#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6230#L551-4 main_#t~short9 := main_#t~short7; 6231#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6251#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 6252#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6236#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 6320#L554-2 assume true; 6318#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6316#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6314#L551-4 main_#t~short9 := main_#t~short7; 6312#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6309#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 6260#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6266#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 6265#L554-2 assume true; 6264#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6263#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6262#L551-4 main_#t~short9 := main_#t~short7; 6261#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6258#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 6259#L552 [2018-11-18 11:02:22,785 INFO L796 eck$LassoCheckResult]: Loop: 6259#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6319#L554 assume !(0 != main_#t~nondet12);havoc main_#t~nondet12;call main_#t~mem15 := read~int(main_~z~0.base, main_~z~0.offset, 4);call write~int(main_#t~mem15 - 1, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~mem15;call write~int(main_#t~nondet16, main_~x~0.base, main_~x~0.offset, 4);havoc main_#t~nondet16; 6317#L554-2 assume true; 6315#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6313#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6311#L551-4 main_#t~short9 := main_#t~short7; 6308#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6309#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 6260#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 6266#L554 assume 0 != main_#t~nondet12;havoc main_#t~nondet12;call main_#t~mem13 := read~int(main_~y~0.base, main_~y~0.offset, 4);call write~int(main_#t~mem13 - 1, main_~y~0.base, main_~y~0.offset, 4);havoc main_#t~mem13;call write~int(main_#t~nondet14, main_~z~0.base, main_~z~0.offset, 4);havoc main_#t~nondet14; 6265#L554-2 assume true; 6264#L551-1 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6263#L551-2 assume main_#t~short7;call main_#t~mem6 := read~int(main_~y~0.base, main_~y~0.offset, 4);main_#t~short7 := main_#t~mem6 > 0; 6262#L551-4 main_#t~short9 := main_#t~short7; 6261#L551-5 assume main_#t~short9;call main_#t~mem8 := read~int(main_~z~0.base, main_~z~0.offset, 4);main_#t~short9 := main_#t~mem8 > 0; 6258#L551-7 assume !!main_#t~short9;havoc main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~mem8; 6259#L552 [2018-11-18 11:02:22,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1265684885, now seen corresponding path program 4 times [2018-11-18 11:02:22,786 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:22,786 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:22,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,787 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:22,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:22,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:22,802 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,802 INFO L82 PathProgramCache]: Analyzing trace with hash -215301723, now seen corresponding path program 1 times [2018-11-18 11:02:22,802 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:22,802 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,802 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:02:22,802 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:22,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:22,811 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:22,811 INFO L82 PathProgramCache]: Analyzing trace with hash -1358042311, now seen corresponding path program 5 times [2018-11-18 11:02:22,811 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:02:22,811 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:02:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,812 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:02:22,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:02:22,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:22,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:02:23,142 WARN L180 SmtUtils]: Spent 306.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-11-18 11:02:23,687 WARN L180 SmtUtils]: Spent 500.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 138 [2018-11-18 11:02:23,784 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:02:23,784 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:02:23,784 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:02:23,784 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:02:23,784 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:02:23,784 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:02:23,784 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:02:23,784 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:02:23,784 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-11-18 11:02:23,784 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:02:23,784 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:02:23,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:23,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:24,019 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:24,020 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:24,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:24,023 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:02:24,242 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:02:24,242 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:02:24,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,242 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,243 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,243 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,243 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,244 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,244 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,245 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,245 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,246 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,246 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,247 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,248 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,248 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,248 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,251 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,251 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,252 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,253 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,254 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,254 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,254 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,257 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,257 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:02:24,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:02:24,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:02:24,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,262 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,264 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:24,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,265 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:24,265 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,268 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,268 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,270 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:24,270 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,270 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:24,270 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,273 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,273 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,274 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,274 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-18 11:02:24,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,275 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:02:24,275 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,277 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,278 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,278 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,284 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,284 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:02:24,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:02:24,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:02:24,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:02:24,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:02:24,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:02:24,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:02:24,287 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-18 11:02:24,289 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-18 11:02:24,290 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-18 11:02:24,290 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-18 11:02:24,290 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-18 11:02:24,291 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-18 11:02:24,291 INFO L518 LassoAnalysis]: Proved termination. [2018-11-18 11:02:24,291 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_9 Supporting invariants [] [2018-11-18 11:02:24,506 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-11-18 11:02:24,509 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-18 11:02:24,526 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:02:24,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:24,543 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:24,557 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,557 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-18 11:02:24,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,568 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,569 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-18 11:02:24,569 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,572 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,576 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,576 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-11-18 11:02:24,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:02:24,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-18 11:02:24,619 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,621 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2018-11-18 11:02:24,623 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,624 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 23 treesize of output 16 [2018-11-18 11:02:24,624 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,631 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 20 [2018-11-18 11:02:24,633 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:24,633 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,637 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,640 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,644 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,644 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2018-11-18 11:02:24,653 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,653 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 39 [2018-11-18 11:02:24,655 INFO L700 Elim1Store]: detected not equals via solver [2018-11-18 11:02:24,656 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 28 treesize of output 19 [2018-11-18 11:02:24,656 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,663 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-18 11:02:24,664 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-18 11:02:24,664 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,668 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,670 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,682 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-18 11:02:24,683 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:55, output treesize:18 [2018-11-18 11:02:24,742 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-11-18 11:02:24,743 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 5 loop predicates [2018-11-18 11:02:24,743 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 178 states and 211 transitions. cyclomatic complexity: 42 Second operand 8 states. [2018-11-18 11:02:24,830 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 178 states and 211 transitions. cyclomatic complexity: 42. Second operand 8 states. Result 472 states and 570 transitions. Complement of second has 11 states. [2018-11-18 11:02:24,830 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 7 states 2 stem states 4 non-accepting loop states 1 accepting loop states [2018-11-18 11:02:24,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-11-18 11:02:24,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 26 transitions. [2018-11-18 11:02:24,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 24 letters. Loop has 16 letters. [2018-11-18 11:02:24,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:24,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 40 letters. Loop has 16 letters. [2018-11-18 11:02:24,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:24,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 26 transitions. Stem has 24 letters. Loop has 32 letters. [2018-11-18 11:02:24,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-18 11:02:24,832 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 472 states and 570 transitions. [2018-11-18 11:02:24,834 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:02:24,834 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 472 states to 0 states and 0 transitions. [2018-11-18 11:02:24,834 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-11-18 11:02:24,834 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-11-18 11:02:24,834 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-11-18 11:02:24,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:02:24,835 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:02:24,835 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:02:24,835 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-18 11:02:24,835 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 11:02:24,835 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-11-18 11:02:24,835 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-11-18 11:02:24,835 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-11-18 11:02:24,841 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:02:24 BoogieIcfgContainer [2018-11-18 11:02:24,841 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:02:24,841 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:02:24,841 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:02:24,842 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:02:24,842 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 10:59:13" (3/4) ... [2018-11-18 11:02:24,845 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-11-18 11:02:24,845 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:02:24,846 INFO L168 Benchmark]: Toolchain (without parser) took 191521.66 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 420.5 MB). Free memory was 956.4 MB in the beginning and 1.3 GB in the end (delta: -359.1 MB). Peak memory consumption was 61.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,846 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:02:24,847 INFO L168 Benchmark]: CACSL2BoogieTranslator took 330.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,847 INFO L168 Benchmark]: Boogie Procedure Inliner took 24.48 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,847 INFO L168 Benchmark]: Boogie Preprocessor took 17.32 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,847 INFO L168 Benchmark]: RCFGBuilder took 178.19 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,848 INFO L168 Benchmark]: BuchiAutomizer took 190964.20 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -234.7 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:02:24,848 INFO L168 Benchmark]: Witness Printer took 3.97 ms. Allocated memory is still 1.4 GB. Free memory is still 1.3 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:02:24,850 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 330.53 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 116.4 MB). Free memory was 956.4 MB in the beginning and 1.1 GB in the end (delta: -149.7 MB). Peak memory consumption was 30.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 24.48 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.4 MB). Peak memory consumption was 3.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 17.32 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.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 178.19 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: 18.4 MB). Peak memory consumption was 18.4 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 190964.20 ms. Allocated memory was 1.1 GB in the beginning and 1.4 GB in the end (delta: 304.1 MB). Free memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: -234.7 MB). Peak memory consumption was 69.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.97 ms. Allocated memory is still 1.4 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (1 trivial, 5 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One deterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 190.9s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 15.6s. Construction of modules took 169.4s. Büchi inclusion checks took 5.6s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 188 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 208 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 15/15 HoareTripleCheckerStatistics: 210 SDtfs, 369 SDslu, 189 SDs, 0 SdLazy, 522 SolverSat, 106 SolverUnsat, 14 SolverUnknown, 0 SolverNotchecked, 169.4s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso9 LassoPreprocessingBenchmarks: Lassos: inital485 mio100 ax105 hnf99 lsp77 ukn67 mio100 lsp34 div100 bol100 ite100 ukn100 eq192 hnf87 smp99 dnf117 smp88 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 59ms VariablesStem: 3 VariablesLoop: 5 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 10 MotzkinApplications: 50 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...