./Ultimate.py --spec ../../sv-benchmarks/c/properties/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 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/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_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/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-635dfa2 [2018-12-08 12:17:10,155 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 12:17:10,156 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 12:17:10,162 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 12:17:10,162 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 12:17:10,162 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 12:17:10,163 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 12:17:10,163 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 12:17:10,164 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 12:17:10,165 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 12:17:10,165 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 12:17:10,165 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 12:17:10,166 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 12:17:10,166 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 12:17:10,166 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 12:17:10,167 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 12:17:10,167 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 12:17:10,168 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 12:17:10,169 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 12:17:10,170 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 12:17:10,170 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 12:17:10,171 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 12:17:10,172 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 12:17:10,172 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 12:17:10,172 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 12:17:10,172 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 12:17:10,173 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 12:17:10,173 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 12:17:10,173 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 12:17:10,174 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 12:17:10,174 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 12:17:10,174 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 12:17:10,174 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 12:17:10,174 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 12:17:10,175 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 12:17:10,175 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 12:17:10,175 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-12-08 12:17:10,183 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 12:17:10,183 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 12:17:10,184 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Use SBE=true [2018-12-08 12:17:10,184 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-08 12:17:10,184 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-08 12:17:10,184 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-08 12:17:10,185 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 12:17:10,185 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 12:17:10,186 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-08 12:17:10,186 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 12:17:10,186 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-08 12:17:10,186 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-08 12:17:10,186 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-08 12:17:10,187 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_2798b4be-945d-442f-b091-17bf88a22380/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-12-08 12:17:10,203 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 12:17:10,210 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 12:17:10,212 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 12:17:10,213 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 12:17:10,213 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 12:17:10,213 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-08 12:17:10,248 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/data/04582499e/2ce34e3a8a4742508081d433b4ad2283/FLAGa4711dfdf [2018-12-08 12:17:10,678 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 12:17:10,678 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-08 12:17:10,684 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/data/04582499e/2ce34e3a8a4742508081d433b4ad2283/FLAGa4711dfdf [2018-12-08 12:17:10,692 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/bin-2019/uautomizer/data/04582499e/2ce34e3a8a4742508081d433b4ad2283 [2018-12-08 12:17:10,694 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 12:17:10,695 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 12:17:10,695 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 12:17:10,695 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 12:17:10,697 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 12:17:10,698 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,699 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b4329b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10, skipping insertion in model container [2018-12-08 12:17:10,699 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,704 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 12:17:10,721 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 12:17:10,862 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:17:10,869 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 12:17:10,934 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 12:17:10,958 INFO L195 MainTranslator]: Completed translation [2018-12-08 12:17:10,958 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10 WrapperNode [2018-12-08 12:17:10,959 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 12:17:10,959 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 12:17:10,959 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 12:17:10,959 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 12:17:10,964 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,974 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,987 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 12:17:10,987 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 12:17:10,987 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 12:17:10,987 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 12:17:10,992 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,992 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,995 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,995 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:10,997 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:11,000 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:11,000 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... [2018-12-08 12:17:11,001 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 12:17:11,002 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 12:17:11,002 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 12:17:11,002 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 12:17:11,002 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_2798b4be-945d-442f-b091-17bf88a22380/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-12-08 12:17:11,033 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 12:17:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 12:17:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-12-08 12:17:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 12:17:11,034 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 12:17:11,034 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 12:17:11,159 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 12:17:11,159 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-12-08 12:17:11,159 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:17:11 BoogieIcfgContainer [2018-12-08 12:17:11,159 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 12:17:11,159 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-08 12:17:11,159 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-08 12:17:11,161 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-08 12:17:11,162 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:17:11,162 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 08.12 12:17:10" (1/3) ... [2018-12-08 12:17:11,162 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f6c851d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:17:11, skipping insertion in model container [2018-12-08 12:17:11,163 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:17:11,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 12:17:10" (2/3) ... [2018-12-08 12:17:11,163 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2f6c851d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 08.12 12:17:11, skipping insertion in model container [2018-12-08 12:17:11,163 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-08 12:17:11,163 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:17:11" (3/3) ... [2018-12-08 12:17:11,165 INFO L375 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i [2018-12-08 12:17:11,199 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-08 12:17:11,199 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-08 12:17:11,199 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-08 12:17:11,199 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-08 12:17:11,199 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 12:17:11,199 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 12:17:11,199 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-08 12:17:11,199 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 12:17:11,199 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-08 12:17:11,207 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 12:17:11,220 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 12:17:11,220 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:11,220 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:11,225 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:17:11,225 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 12:17:11,225 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-08 12:17:11,225 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2018-12-08 12:17:11,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 12:17:11,226 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:11,226 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:11,226 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-12-08 12:17:11,226 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 12:17:11,230 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 9#L-1true 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-12-08 12:17:11,231 INFO L796 eck$LassoCheckResult]: Loop: 11#L554-2true call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 14#L551-1true 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; 3#L551-3true main_#t~short9 := main_#t~short7; 5#L551-4true 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-6true assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;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-12-08 12:17:11,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:11,234 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-12-08 12:17:11,235 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:11,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:11,267 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,268 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:11,268 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:11,301 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2018-12-08 12:17:11,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:11,302 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:11,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,303 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:11,303 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,323 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:11,323 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2018-12-08 12:17:11,323 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:11,323 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,324 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:11,324 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:11,336 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:11,481 WARN L180 SmtUtils]: Spent 129.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2018-12-08 12:17:11,615 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:17:11,616 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:17:11,616 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:17:11,616 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:17:11,616 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:17:11,617 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:17:11,617 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:17:11,617 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:17:11,617 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration1_Lasso [2018-12-08 12:17:11,617 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:17:11,618 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:17:11,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,853 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,856 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,858 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,860 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,864 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,865 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,866 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,868 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,869 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,870 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,871 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:11,873 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:12,151 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:17:12,154 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:17:12,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:12,156 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:12,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:12,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:12,157 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:12,164 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:12,164 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:12,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:12,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:12,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:12,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:12,196 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:12,196 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:12,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:12,197 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:12,203 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:12,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:12,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:12,203 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:12,204 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:12,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:12,205 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:12,205 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:12,210 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:12,210 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:12,210 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:12,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:12,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:12,210 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:12,211 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:12,212 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:12,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:12,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:12,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:12,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:12,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:12,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:12,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:12,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:12,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:12,219 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:17:12,221 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:17:12,221 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:17:12,223 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:17:12,223 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2018-12-08 12:17:12,223 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:17:12,223 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-12-08 12:17:12,281 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:17:12,285 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:17:12,295 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:12,304 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:12,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:12,316 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:12,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:12,349 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-12-08 12:17:12,350 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2018-12-08 12:17:12,409 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 13 states.. Second operand 4 states. Result 60 states and 79 transitions. Complement of second has 10 states. [2018-12-08 12:17:12,409 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-12-08 12:17:12,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 12:17:12,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2018-12-08 12:17:12,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2018-12-08 12:17:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:12,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2018-12-08 12:17:12,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:12,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2018-12-08 12:17:12,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:12,413 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2018-12-08 12:17:12,415 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:12,417 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2018-12-08 12:17:12,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2018-12-08 12:17:12,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2018-12-08 12:17:12,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2018-12-08 12:17:12,419 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:17:12,419 INFO L705 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2018-12-08 12:17:12,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2018-12-08 12:17:12,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2018-12-08 12:17:12,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-08 12:17:12,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2018-12-08 12:17:12,435 INFO L728 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-08 12:17:12,435 INFO L608 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2018-12-08 12:17:12,435 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-08 12:17:12,435 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2018-12-08 12:17:12,436 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:12,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:12,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:12,436 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2018-12-08 12:17:12,436 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 12:17:12,436 INFO L794 eck$LassoCheckResult]: Stem: 231#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 225#L-1 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; 226#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-12-08 12:17:12,436 INFO L796 eck$LassoCheckResult]: Loop: 246#L551-1 assume !main_#t~short7; 227#L551-3 main_#t~short9 := main_#t~short7; 228#L551-4 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; 232#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 242#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; 247#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 246#L551-1 [2018-12-08 12:17:12,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,437 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2018-12-08 12:17:12,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:12,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,438 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:12,438 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2018-12-08 12:17:12,450 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:12,451 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:12,451 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,452 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:12,452 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:12,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:12,479 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 12:17:12,480 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 12:17:12,480 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-08 12:17:12,482 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-08 12:17:12,482 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-08 12:17:12,483 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2018-12-08 12:17:12,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 12:17:12,504 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2018-12-08 12:17:12,504 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-08 12:17:12,505 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2018-12-08 12:17:12,506 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 12:17:12,506 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2018-12-08 12:17:12,506 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-12-08 12:17:12,506 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-12-08 12:17:12,506 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2018-12-08 12:17:12,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:17:12,507 INFO L705 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 12:17:12,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2018-12-08 12:17:12,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-08 12:17:12,508 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-08 12:17:12,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2018-12-08 12:17:12,508 INFO L728 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 12:17:12,509 INFO L608 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2018-12-08 12:17:12,509 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-08 12:17:12,509 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2018-12-08 12:17:12,509 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2018-12-08 12:17:12,509 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:12,509 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:12,510 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:17:12,510 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:17:12,510 INFO L794 eck$LassoCheckResult]: Stem: 306#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 302#L-1 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; 303#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 311#L551-1 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; 318#L551-3 main_#t~short9 := main_#t~short7; 317#L551-4 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; 316#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-12-08 12:17:12,510 INFO L796 eck$LassoCheckResult]: Loop: 313#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; 307#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 308#L551-1 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; 298#L551-3 main_#t~short9 := main_#t~short7; 299#L551-4 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; 304#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2018-12-08 12:17:12,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,510 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2018-12-08 12:17:12,511 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:12,511 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:12,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,511 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:12,512 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,530 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,531 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2018-12-08 12:17:12,531 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:12,531 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,532 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:12,532 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:12,544 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2018-12-08 12:17:12,545 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:12,545 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:12,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,546 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:12,546 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:12,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:12,697 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-12-08 12:17:12,874 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 84 [2018-12-08 12:17:12,919 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:17:12,920 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:17:12,920 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:17:12,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:17:12,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:17:12,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:17:12,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:17:12,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:17:12,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration3_Lasso [2018-12-08 12:17:12,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:17:12,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:17:12,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:12,925 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:12,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:12,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:12,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,112 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,116 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,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-12-08 12:17:13,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,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-12-08 12:17:13,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-12-08 12:17:13,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:13,396 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:17:13,396 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:17:13,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:13,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:13,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:13,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:13,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:13,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:13,398 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:13,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:13,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:13,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:13,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:13,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:13,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:13,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:13,399 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:13,399 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:13,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:13,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:13,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:13,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:13,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:13,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:13,400 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:17:13,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:13,401 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:17:13,401 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:13,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:13,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:13,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:13,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:13,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:13,402 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:13,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:13,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:13,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:13,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:13,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:13,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:13,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:13,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:13,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:13,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:13,409 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:17:13,412 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:17:13,412 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2018-12-08 12:17:13,413 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:17:13,413 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:17:13,413 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:17:13,414 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-12-08 12:17:13,461 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:17:13,463 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:17:13,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:13,482 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:13,493 INFO L478 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-12-08 12:17:13,498 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:13,499 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:13,499 INFO L478 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-12-08 12:17:13,500 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,502 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,505 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,505 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:17:13,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:13,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:13,515 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:13,515 INFO L478 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-12-08 12:17:13,518 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:13,519 INFO L478 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-12-08 12:17:13,520 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,527 INFO L478 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-12-08 12:17:13,529 INFO L478 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-12-08 12:17:13,530 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,536 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,545 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,550 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:13,550 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-08 12:17:13,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:13,622 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-12-08 12:17:13,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2018-12-08 12:17:13,695 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6. Second operand 7 states. Result 48 states and 58 transitions. Complement of second has 12 states. [2018-12-08 12:17:13,695 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-12-08 12:17:13,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:17:13,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-08 12:17:13,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2018-12-08 12:17:13,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:13,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2018-12-08 12:17:13,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:13,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2018-12-08 12:17:13,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:13,697 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2018-12-08 12:17:13,698 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:13,698 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2018-12-08 12:17:13,698 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2018-12-08 12:17:13,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-12-08 12:17:13,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2018-12-08 12:17:13,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:17:13,699 INFO L705 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2018-12-08 12:17:13,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2018-12-08 12:17:13,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2018-12-08 12:17:13,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-12-08 12:17:13,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2018-12-08 12:17:13,701 INFO L728 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-08 12:17:13,701 INFO L608 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2018-12-08 12:17:13,701 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-08 12:17:13,701 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2018-12-08 12:17:13,702 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:13,702 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:13,702 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:13,702 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:17:13,702 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 12:17:13,702 INFO L794 eck$LassoCheckResult]: Stem: 557#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 553#L-1 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; 554#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 577#L551-1 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; 582#L551-3 main_#t~short9 := main_#t~short7; 581#L551-4 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; 580#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 579#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 578#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; 559#L554-2 [2018-12-08 12:17:13,703 INFO L796 eck$LassoCheckResult]: Loop: 559#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 563#L551-1 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; 549#L551-3 main_#t~short9 := main_#t~short7; 550#L551-4 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; 555#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 558#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; 559#L554-2 [2018-12-08 12:17:13,703 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:13,703 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2018-12-08 12:17:13,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:13,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,704 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:13,704 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,709 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,715 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:13,715 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2018-12-08 12:17:13,715 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:13,715 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:13,716 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,723 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:13,723 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2018-12-08 12:17:13,723 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:13,723 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,724 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:17:13,724 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:13,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:13,984 WARN L180 SmtUtils]: Spent 148.00 ms on a formula simplification. DAG size of input: 127 DAG size of output: 90 [2018-12-08 12:17:14,023 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:17:14,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:17:14,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:17:14,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:17:14,023 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:17:14,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:17:14,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:17:14,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:17:14,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration4_Lasso [2018-12-08 12:17:14,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:17:14,024 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:17:14,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,213 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,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-12-08 12:17:14,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:14,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-12-08 12:17:14,446 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:17:14,447 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:17:14,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,447 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:14,447 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,448 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,448 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:14,448 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:14,448 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,448 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,449 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,449 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,449 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,449 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,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-12-08 12:17:14,450 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,450 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,451 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,451 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,451 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,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-12-08 12:17:14,453 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,453 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:14,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,453 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,453 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:14,453 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,456 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,456 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,457 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,457 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,461 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,461 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,461 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,461 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,462 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,462 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,463 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,463 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,467 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,467 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,467 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,468 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,468 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,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-12-08 12:17:14,471 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,472 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,472 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,472 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,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-12-08 12:17:14,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,474 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:14,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,474 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,475 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:14,475 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,479 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:14,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,479 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,480 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:14,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:14,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:14,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:14,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:14,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:14,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:14,482 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:14,482 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:14,483 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:14,486 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:17:14,488 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:17:14,489 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:17:14,489 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:17:14,490 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:17:14,490 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:17:14,490 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-12-08 12:17:14,551 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:17:14,552 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:17:14,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:14,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:14,565 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:14,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:14,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:14,590 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:14,590 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-12-08 12:17:14,590 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2018-12-08 12:17:14,612 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12. Second operand 4 states. Result 55 states and 66 transitions. Complement of second has 7 states. [2018-12-08 12:17:14,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-12-08 12:17:14,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-12-08 12:17:14,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2018-12-08 12:17:14,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2018-12-08 12:17:14,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:14,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2018-12-08 12:17:14,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:14,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2018-12-08 12:17:14,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:14,613 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2018-12-08 12:17:14,614 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:14,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2018-12-08 12:17:14,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2018-12-08 12:17:14,615 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-12-08 12:17:14,615 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2018-12-08 12:17:14,615 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:17:14,615 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2018-12-08 12:17:14,615 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2018-12-08 12:17:14,617 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2018-12-08 12:17:14,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-08 12:17:14,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2018-12-08 12:17:14,618 INFO L728 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-08 12:17:14,618 INFO L608 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2018-12-08 12:17:14,618 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-08 12:17:14,618 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2018-12-08 12:17:14,618 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2018-12-08 12:17:14,618 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:14,618 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:14,619 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-08 12:17:14,619 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2018-12-08 12:17:14,619 INFO L794 eck$LassoCheckResult]: Stem: 819#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 815#L-1 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; 816#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 845#L551-1 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; 844#L551-3 main_#t~short9 := main_#t~short7; 843#L551-4 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; 842#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 841#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 840#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; 831#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 838#L551-1 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; 837#L551-3 main_#t~short9 := main_#t~short7; 835#L551-4 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; 836#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 848#L552 [2018-12-08 12:17:14,619 INFO L796 eck$LassoCheckResult]: Loop: 848#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; 849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 858#L551-1 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; 855#L551-3 main_#t~short9 := main_#t~short7; 854#L551-4 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; 851#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 848#L552 [2018-12-08 12:17:14,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:14,619 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2018-12-08 12:17:14,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:14,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:14,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:14,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:14,636 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:14,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2018-12-08 12:17:14,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:14,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:14,637 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,638 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:17:14,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:14,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:14,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:14,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2018-12-08 12:17:14,645 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:14,645 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,646 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:17:14,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:14,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:14,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,036 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 166 DAG size of output: 108 [2018-12-08 12:17:15,087 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:17:15,087 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:17:15,087 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:17:15,087 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:17:15,087 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:17:15,087 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:17:15,088 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:17:15,088 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:17:15,088 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration5_Lasso [2018-12-08 12:17:15,088 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:17:15,088 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:17:15,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,092 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,103 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,105 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,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-12-08 12:17:15,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-12-08 12:17:15,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-12-08 12:17:15,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-12-08 12:17:15,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-12-08 12:17:15,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-12-08 12:17:15,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:15,526 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:17:15,527 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:17:15,527 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,527 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,528 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,529 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,529 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,529 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,529 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,530 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,530 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,530 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,530 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,530 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,531 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,532 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,532 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,532 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,532 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,533 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,533 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,533 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,533 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,533 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,534 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,534 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,534 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,534 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,534 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,534 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,534 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,535 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,535 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,535 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,535 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,535 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,535 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,536 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,536 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,536 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,537 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,537 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,537 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,537 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:15,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,538 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,539 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:15,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:15,539 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,539 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,540 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,540 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,541 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,541 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,542 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,542 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,543 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,543 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,543 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,543 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,543 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,544 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,546 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,547 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:15,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,547 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,547 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:15,548 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,551 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,551 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,552 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,552 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,555 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,555 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,555 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,556 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,556 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,558 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,558 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,558 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,562 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,563 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,563 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,566 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,566 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,567 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,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-12-08 12:17:15,570 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,570 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,570 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,571 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,571 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:15,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:15,572 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:15,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:15,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:15,572 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:15,573 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:15,573 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:15,577 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:17:15,581 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:17:15,581 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:17:15,581 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:17:15,582 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:17:15,582 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:17:15,582 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-12-08 12:17:15,627 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:17:15,628 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:17:15,638 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,646 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,651 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,654 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,654 INFO L478 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-12-08 12:17:15,656 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,657 INFO L478 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-12-08 12:17:15,657 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,659 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,660 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,660 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-08 12:17:15,683 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:15,683 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-12-08 12:17:15,683 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 12:17:15,708 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 74 states and 87 transitions. Complement of second has 9 states. [2018-12-08 12:17:15,709 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-12-08 12:17:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:17:15,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2018-12-08 12:17:15,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 12:17:15,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:15,709 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:17:15,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,724 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,728 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,730 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,731 INFO L478 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-12-08 12:17:15,733 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,733 INFO L478 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-12-08 12:17:15,734 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,735 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,736 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,736 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-08 12:17:15,756 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:15,756 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-12-08 12:17:15,756 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 12:17:15,786 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 72 states and 83 transitions. Complement of second has 11 states. [2018-12-08 12:17:15,786 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-12-08 12:17:15,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:17:15,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-12-08 12:17:15,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 12:17:15,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:15,787 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:17:15,793 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,801 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:15,805 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:15,807 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,808 INFO L478 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-12-08 12:17:15,809 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:15,810 INFO L478 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-12-08 12:17:15,810 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,811 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,812 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:15,812 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2018-12-08 12:17:15,841 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:15,841 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-12-08 12:17:15,841 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2018-12-08 12:17:15,863 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15. Second operand 5 states. Result 118 states and 142 transitions. Complement of second has 10 states. [2018-12-08 12:17:15,863 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-12-08 12:17:15,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:17:15,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2018-12-08 12:17:15,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2018-12-08 12:17:15,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:15,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2018-12-08 12:17:15,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:15,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2018-12-08 12:17:15,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:17:15,864 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2018-12-08 12:17:15,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-08 12:17:15,867 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2018-12-08 12:17:15,867 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2018-12-08 12:17:15,867 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-08 12:17:15,867 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2018-12-08 12:17:15,867 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:17:15,867 INFO L705 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2018-12-08 12:17:15,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2018-12-08 12:17:15,869 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2018-12-08 12:17:15,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2018-12-08 12:17:15,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2018-12-08 12:17:15,870 INFO L728 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-12-08 12:17:15,870 INFO L608 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2018-12-08 12:17:15,870 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-08 12:17:15,870 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2018-12-08 12:17:15,870 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2018-12-08 12:17:15,870 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:17:15,870 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:17:15,871 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-08 12:17:15,871 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2018-12-08 12:17:15,871 INFO L794 eck$LassoCheckResult]: Stem: 1473#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1469#L-1 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; 1470#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1498#L551-1 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; 1494#L551-3 main_#t~short9 := main_#t~short7; 1491#L551-4 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; 1489#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 1486#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1487#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; 1474#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1476#L551-1 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; 1465#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-12-08 12:17:15,871 INFO L796 eck$LassoCheckResult]: Loop: 1466#L551-4 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; 1471#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 1479#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 1480#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; 1504#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1526#L551-1 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; 1525#L551-3 main_#t~short9 := main_#t~short7; 1524#L551-4 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; 1523#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 1522#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; 1477#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 1478#L551-1 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; 1531#L551-3 main_#t~short9 := main_#t~short7; 1466#L551-4 [2018-12-08 12:17:15,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,871 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2018-12-08 12:17:15,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:15,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:15,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2018-12-08 12:17:15,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:15,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,886 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:17:15,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,890 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,897 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:15,897 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2018-12-08 12:17:15,897 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:17:15,897 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:17:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,898 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:17:15,898 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:17:15,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:15,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:17:16,135 WARN L180 SmtUtils]: Spent 217.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2018-12-08 12:17:16,454 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification. DAG size of input: 154 DAG size of output: 105 [2018-12-08 12:17:16,537 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:17:16,537 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:17:16,537 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:17:16,537 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:17:16,538 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:17:16,538 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:17:16,538 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:17:16,538 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:17:16,538 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration6_Lasso [2018-12-08 12:17:16,538 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:17:16,538 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:17:16,542 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,554 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,557 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,558 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,560 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,562 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,564 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,566 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,777 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:16,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:17:17,014 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:17:17,014 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:17:17,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:17,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,016 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,016 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,016 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,018 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,018 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,018 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,019 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,019 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,021 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:17:17,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,021 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:17:17,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,022 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,022 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,022 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,022 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,022 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:17,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:17,023 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17: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-12-08 12:17:17,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,024 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,024 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:17,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,025 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,025 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:17:17,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,025 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:17:17,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:17:17,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,026 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,026 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:17,026 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,026 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,027 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:17,027 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,029 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:17,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,029 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:17,029 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17: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-12-08 12:17:17,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,031 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,031 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,032 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,032 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,038 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,038 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,038 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,040 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,040 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,041 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,041 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,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-12-08 12:17:17,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,043 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,043 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,045 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,045 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:17:17,045 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,045 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,046 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:17:17,046 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:17:17,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:17:17,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:17:17,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:17:17,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:17:17,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:17:17,048 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:17:17,049 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:17:17,054 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:17:17,058 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 12:17:17,058 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:17:17,058 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:17:17,059 INFO L440 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 2. [2018-12-08 12:17:17,059 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:17:17,059 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_#t~mem5) = 1*ULTIMATE.start_main_#t~mem5 Supporting invariants [2*ULTIMATE.start_main_#t~mem5 - 1 >= 0, 1*ULTIMATE.start_main_#t~mem5 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 >= 0] [2018-12-08 12:17:17,121 INFO L297 tatePredicateManager]: 24 out of 26 supporting invariants were superfluous and have been removed [2018-12-08 12:17:17,136 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:17:17,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:17,144 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:17,150 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,151 INFO L478 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-12-08 12:17:17,160 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,161 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,161 INFO L478 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-12-08 12:17:17,162 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,165 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,168 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,169 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 12:17:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:17:17,182 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:17:17,199 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,210 INFO L478 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-12-08 12:17:17,214 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,215 INFO L478 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-12-08 12:17:17,215 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,242 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,249 INFO L478 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-12-08 12:17:17,250 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 12:17:17,284 INFO L478 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-12-08 12:17:17,285 INFO L478 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-12-08 12:17:17,286 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,290 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,294 INFO L478 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-12-08 12:17:17,295 INFO L478 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-12-08 12:17:17,296 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,301 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,328 INFO L478 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-12-08 12:17:17,329 INFO L478 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-12-08 12:17:17,330 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,333 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,361 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:17:17,374 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:17:17,374 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 3 variables, input treesize:51, output treesize:50 [2018-12-08 12:17:17,627 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,629 INFO L478 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-12-08 12:17:17,631 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,631 INFO L478 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-12-08 12:17:17,632 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,637 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,665 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,672 INFO L478 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-12-08 12:17:17,680 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,681 INFO L478 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-12-08 12:17:17,681 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,705 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,705 INFO L478 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-12-08 12:17:17,706 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,719 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:17:17,740 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,747 INFO L478 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-12-08 12:17:17,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,750 INFO L478 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-12-08 12:17:17,751 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,764 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:17:17,765 INFO L478 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-12-08 12:17:17,765 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:17:17,775 INFO L267 ElimStorePlain]: Start of recursive call 7: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:17:17,794 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-12-08 12:17:17,794 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 8 variables, input treesize:119, output treesize:93 [2018-12-08 12:17:18,055 WARN L180 SmtUtils]: Spent 161.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 48 [2018-12-08 12:17:18,109 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:17:18,109 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.3 stem predicates 9 loop predicates [2018-12-08 12:17:18,110 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 12 states. [2018-12-08 12:18:18,690 WARN L180 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 78 [2018-12-08 12:18:18,977 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 49 [2018-12-08 12:18:43,010 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 12 states. Result 122 states and 143 transitions. Complement of second has 21 states. [2018-12-08 12:18:43,010 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 3 stem states 8 non-accepting loop states 1 accepting loop states [2018-12-08 12:18:43,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-12-08 12:18:43,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 18 transitions. [2018-12-08 12:18:43,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 18 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-08 12:18:43,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:43,010 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:43,023 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:43,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:43,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:43,039 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,039 INFO L478 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-12-08 12:18:43,048 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,049 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,049 INFO L478 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-12-08 12:18:43,050 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,052 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,055 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,055 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 12:18:43,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:43,068 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:43,082 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,090 INFO L478 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-12-08 12:18:43,096 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,106 INFO L478 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-12-08 12:18:43,107 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-12-08 12:18:43,149 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,149 INFO L478 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-12-08 12:18:43,150 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,184 INFO L478 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-12-08 12:18:43,186 INFO L478 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-12-08 12:18:43,186 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,191 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,195 INFO L478 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-12-08 12:18:43,196 INFO L478 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-12-08 12:18:43,196 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,201 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,228 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,230 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,241 INFO L478 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-12-08 12:18:43,243 INFO L478 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-12-08 12:18:43,244 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,264 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:43,294 INFO L478 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-12-08 12:18:43,295 INFO L478 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-12-08 12:18:43,295 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,299 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,315 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:18:43,330 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:43,330 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-12-08 12:18:43,340 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,341 INFO L478 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-12-08 12:18:43,343 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,344 INFO L478 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-12-08 12:18:43,344 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,345 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,347 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,348 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-12-08 12:18:43,378 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:18:43,378 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.3 stem predicates 5 loop predicates [2018-12-08 12:18:43,378 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 12:18:43,437 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 105 states and 124 transitions. Complement of second has 15 states. [2018-12-08 12:18:43,437 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 9 states 3 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-08 12:18:43,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:43,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 17 transitions. [2018-12-08 12:18:43,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 9 states and 17 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-08 12:18:43,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:43,437 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:43,452 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:43,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:43,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:43,466 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,466 INFO L478 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-12-08 12:18:43,476 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,477 INFO L478 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-12-08 12:18:43,477 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,480 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,483 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,483 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 12:18:43,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:43,496 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:43,508 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,517 INFO L478 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-12-08 12:18:43,520 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,520 INFO L478 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-12-08 12:18:43,521 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,548 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,557 INFO L478 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-12-08 12:18:43,558 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 3 xjuncts. [2018-12-08 12:18:43,593 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,596 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,606 INFO L478 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-12-08 12:18:43,608 INFO L478 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-12-08 12:18:43,609 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,626 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:43,662 INFO L478 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-12-08 12:18:43,663 INFO L478 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-12-08 12:18:43,663 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,667 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,691 INFO L478 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-12-08 12:18:43,693 INFO L478 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-12-08 12:18:43,693 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,698 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,701 INFO L478 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-12-08 12:18:43,703 INFO L478 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-12-08 12:18:43,703 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,708 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,721 INFO L267 ElimStorePlain]: Start of recursive call 2: 2 dim-1 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-12-08 12:18:43,735 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:43,735 INFO L202 ElimStorePlain]: Needed 12 recursive calls to eliminate 5 variables, input treesize:51, output treesize:27 [2018-12-08 12:18:43,744 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,744 INFO L478 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-12-08 12:18:43,746 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:43,747 INFO L478 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-12-08 12:18:43,747 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,748 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,752 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:43,752 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:29, output treesize:14 [2018-12-08 12:18:43,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-08 12:18:43,788 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.3 stem predicates 5 loop predicates [2018-12-08 12:18:43,788 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 8 states. [2018-12-08 12:18:43,854 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 8 states. Result 141 states and 167 transitions. Complement of second has 15 states. [2018-12-08 12:18:43,854 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 3 stem states 4 non-accepting loop states 1 accepting loop states [2018-12-08 12:18:43,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:43,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 24 transitions. [2018-12-08 12:18:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 12 letters. Loop has 13 letters. [2018-12-08 12:18:43,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:43,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 25 letters. Loop has 13 letters. [2018-12-08 12:18:43,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:43,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 24 transitions. Stem has 12 letters. Loop has 26 letters. [2018-12-08 12:18:43,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:43,857 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 141 states and 167 transitions. [2018-12-08 12:18:43,858 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 30 [2018-12-08 12:18:43,859 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 141 states to 110 states and 130 transitions. [2018-12-08 12:18:43,860 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-12-08 12:18:43,860 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2018-12-08 12:18:43,860 INFO L73 IsDeterministic]: Start isDeterministic. Operand 110 states and 130 transitions. [2018-12-08 12:18:43,860 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:18:43,860 INFO L705 BuchiCegarLoop]: Abstraction has 110 states and 130 transitions. [2018-12-08 12:18:43,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states and 130 transitions. [2018-12-08 12:18:43,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 92. [2018-12-08 12:18:43,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2018-12-08 12:18:43,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2018-12-08 12:18:43,865 INFO L728 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-12-08 12:18:43,865 INFO L608 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2018-12-08 12:18:43,865 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-08 12:18:43,865 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 112 transitions. [2018-12-08 12:18:43,866 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-08 12:18:43,866 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:18:43,866 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:18:43,866 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2018-12-08 12:18:43,866 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:18:43,866 INFO L794 eck$LassoCheckResult]: Stem: 2357#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2353#L-1 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; 2354#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2397#L551-1 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; 2393#L551-3 main_#t~short9 := main_#t~short7; 2394#L551-4 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; 2366#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 2358#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2359#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; 2374#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2440#L551-1 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; 2439#L551-3 main_#t~short9 := main_#t~short7; 2438#L551-4 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; 2355#L551-6 [2018-12-08 12:18:43,867 INFO L796 eck$LassoCheckResult]: Loop: 2355#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 2382#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2377#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; 2362#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2363#L551-1 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; 2430#L551-3 main_#t~short9 := main_#t~short7; 2429#L551-4 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; 2355#L551-6 [2018-12-08 12:18:43,867 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:43,867 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2018-12-08 12:18:43,867 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:43,867 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:43,867 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,868 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:18:43,868 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:43,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:43,878 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:43,878 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 1 times [2018-12-08 12:18:43,878 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:43,879 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,879 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:43,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:43,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:43,885 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:43,885 INFO L82 PathProgramCache]: Analyzing trace with hash -1982470167, now seen corresponding path program 4 times [2018-12-08 12:18:43,885 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:43,885 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,886 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:18:43,886 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:43,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:43,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:44,021 WARN L180 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-08 12:18:44,410 WARN L180 SmtUtils]: Spent 290.00 ms on a formula simplification. DAG size of input: 165 DAG size of output: 116 [2018-12-08 12:18:44,817 WARN L180 SmtUtils]: Spent 401.00 ms on a formula simplification. DAG size of input: 95 DAG size of output: 95 [2018-12-08 12:18:44,819 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:18:44,819 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:18:44,819 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:18:44,819 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:18:44,819 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:18:44,819 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:18:44,819 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:18:44,819 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:18:44,819 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration7_Lasso [2018-12-08 12:18:44,819 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:18:44,820 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:18:44,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,834 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:44,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:45,190 WARN L180 SmtUtils]: Spent 284.00 ms on a formula simplification. DAG size of input: 88 DAG size of output: 76 [2018-12-08 12:18:45,275 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:45,277 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:45,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-12-08 12:18:45,583 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:18:45,583 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:18:45,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-12-08 12:18:45,584 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,584 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,584 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,584 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,585 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,585 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,586 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,586 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,586 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,587 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,587 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,588 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,588 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,589 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,589 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,590 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,590 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,591 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,591 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,591 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,592 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,592 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,592 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,592 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,592 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,592 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,592 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,593 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,593 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,593 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,594 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,594 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,594 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,594 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,594 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,595 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,595 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,595 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,595 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,595 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,595 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,596 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,596 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,597 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,597 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,598 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,598 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,599 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,600 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,600 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,600 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,601 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,601 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,601 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,601 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,602 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:45,602 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,604 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,604 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,604 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,605 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,605 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:45,605 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,607 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:45,607 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,623 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,624 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,624 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,624 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,624 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,625 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:45,625 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,627 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,628 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,628 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,628 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,630 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,631 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,631 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,632 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,634 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,634 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,634 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,635 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,636 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,637 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,637 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,638 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,639 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,639 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,639 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,639 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,639 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:45,639 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,641 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,641 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,642 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,643 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,644 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,644 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,646 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,646 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,646 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,647 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,647 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,647 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,647 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,648 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,648 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,653 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,653 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,653 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,654 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,654 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,655 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,655 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,655 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:45,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,656 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:45,657 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:45,657 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:45,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,657 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:18:45,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-12-08 12:18:45,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,658 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,658 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,658 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,659 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,659 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,660 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,660 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,660 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,660 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,661 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,661 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,661 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,662 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,663 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,663 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,663 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,663 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,663 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,664 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,665 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,665 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,665 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,666 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,666 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,666 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,667 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,667 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,668 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,668 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,669 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,669 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,669 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,670 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,670 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,670 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,670 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,670 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,671 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,671 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,671 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,671 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,672 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,672 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,674 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,674 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:45,674 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,676 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-08 12:18:45,676 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-08 12:18:45,687 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,687 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,688 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,688 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,688 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,688 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,688 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,688 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,691 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,691 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,691 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,694 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,694 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,694 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,694 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,694 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,694 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,696 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,697 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,697 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,697 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,697 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,697 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,697 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,698 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,699 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,699 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,699 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,701 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,702 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,702 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,702 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,703 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,703 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,705 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,705 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,706 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,706 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,708 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,708 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,708 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,709 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,709 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,711 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,712 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,712 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,712 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,713 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,713 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,713 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,713 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,714 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,714 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,720 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,721 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,721 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,721 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,722 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,722 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,723 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,723 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,723 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,723 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,723 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,723 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,723 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,724 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,724 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,724 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,724 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,725 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,725 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,725 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,725 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,726 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,726 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:18:45,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-12-08 12:18:45,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,727 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,727 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,727 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,727 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,727 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,728 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,729 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,729 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,729 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,729 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,731 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,731 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,731 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,733 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,734 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,734 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,735 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,735 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,735 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,736 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,736 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,736 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,736 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,737 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,737 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,737 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,737 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,737 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,738 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,738 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,738 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,738 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,739 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,739 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,739 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,739 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,739 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,740 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,740 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,740 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,740 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,741 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,741 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,742 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,742 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,742 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,742 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,743 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,743 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,743 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,744 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:45,744 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,746 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,747 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,747 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,747 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:45,747 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,749 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-12-08 12:18:45,750 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-08 12:18:45,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,771 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,772 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,772 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:45,772 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,775 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,775 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,775 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,775 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,776 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,776 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,778 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,779 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,780 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,780 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,783 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,783 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,783 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,784 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,785 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,786 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,786 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,789 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,790 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,790 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,790 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,790 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,791 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:45,791 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,794 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,794 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,794 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,794 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,797 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,798 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,798 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,798 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,799 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,799 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,801 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,802 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,802 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,802 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,802 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,802 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,803 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,803 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,804 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,804 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,804 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,806 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,806 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,815 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,815 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,817 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,817 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,817 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,817 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,818 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,818 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,818 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,818 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,818 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,818 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,819 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:45,819 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,819 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,819 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,819 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:45,820 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,820 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:45,821 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,821 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:18:45,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-12-08 12:18:45,822 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,822 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,822 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,822 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,822 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,824 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,824 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,824 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,825 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,826 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,826 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,826 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,826 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,827 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,827 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,828 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,829 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,829 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,829 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,829 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,831 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,831 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,832 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,833 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,833 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,834 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,835 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,835 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,836 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,836 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,836 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,838 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,838 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,839 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,839 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,840 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:45,840 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,843 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,843 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:45,843 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,846 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-12-08 12:18:45,846 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-12-08 12:18:45,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,865 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,865 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,866 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,866 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:45,866 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,869 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,870 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,870 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,870 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,870 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,870 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,870 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,874 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,875 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,875 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,879 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,879 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,879 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,880 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,881 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,881 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,882 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,882 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,886 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,886 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,886 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,886 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,886 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,887 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:45,887 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,891 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,891 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,891 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,891 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,892 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,892 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,895 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,895 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,896 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,896 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,900 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,901 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,901 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,903 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,905 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,905 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,914 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,914 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,915 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,915 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,915 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,915 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,916 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,916 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,918 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,918 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,918 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,918 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,918 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,918 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,918 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,919 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,919 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,919 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,919 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,920 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,920 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,920 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,920 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,920 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:45,920 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,920 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,921 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,921 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:45,921 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,921 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,921 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:45,921 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:45,922 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:45,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,923 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:18:45,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,924 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,924 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,925 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,925 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,926 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,926 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,926 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,926 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,927 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,927 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,927 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,927 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,927 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,928 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,929 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,929 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,929 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,929 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,929 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,929 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,929 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,930 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,931 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,931 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,931 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,932 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,932 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,932 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,934 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,934 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,934 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,934 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,935 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,935 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,935 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,935 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,935 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,935 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,935 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,936 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,936 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,936 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,937 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,937 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,937 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,937 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,937 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,938 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,938 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,938 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,938 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,938 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,938 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,939 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,939 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,939 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,940 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,940 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,940 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,940 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:45,940 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,941 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,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-12-08 12:18:45,942 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,942 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,942 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:45,942 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:45,942 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,942 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,942 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:45,942 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:45,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,943 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,943 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,943 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,943 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:45,944 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,944 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:45,944 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:45,947 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:45,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:45,947 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:45,947 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:45,947 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:45,947 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:45,947 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:45,950 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-08 12:18:45,950 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-08 12:18:46,007 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:18:46,040 INFO L443 ModelExtractionUtils]: Simplification made 10 calls to the SMT solver. [2018-12-08 12:18:46,040 INFO L444 ModelExtractionUtils]: 21 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 12:18:46,040 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:18:46,041 INFO L440 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2018-12-08 12:18:46,042 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:18:46,042 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*ULTIMATE.start_main_#t~mem8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_6 Supporting invariants [1*ULTIMATE.start_main_#t~mem8 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_6 >= 0] [2018-12-08 12:18:46,142 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-12-08 12:18:46,163 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:46,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:46,172 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:46,181 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,182 INFO L478 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-12-08 12:18:46,192 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,193 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,193 INFO L478 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-12-08 12:18:46,193 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,196 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,199 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,199 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2018-12-08 12:18:46,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:46,212 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:46,238 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,238 INFO L478 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-12-08 12:18:46,240 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,241 INFO L478 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-12-08 12:18:46,241 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,250 INFO L478 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-12-08 12:18:46,252 INFO L478 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-12-08 12:18:46,252 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,256 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,264 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,282 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,283 INFO L478 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-12-08 12:18:46,286 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:46,286 INFO L478 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-12-08 12:18:46,287 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,370 INFO L478 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-12-08 12:18:46,388 INFO L478 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-12-08 12:18:46,388 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,393 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,399 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:46,414 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:46,414 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:115, output treesize:41 [2018-12-08 12:18:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:46,439 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-12-08 12:18:46,439 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 5 states. [2018-12-08 12:18:46,556 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 5 states. Result 196 states and 234 transitions. Complement of second has 10 states. [2018-12-08 12:18:46,556 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-12-08 12:18:46,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:18:46,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-08 12:18:46,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2018-12-08 12:18:46,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:46,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-08 12:18:46,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:46,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 14 letters. [2018-12-08 12:18:46,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:46,558 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 196 states and 234 transitions. [2018-12-08 12:18:46,559 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-08 12:18:46,560 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 196 states to 175 states and 210 transitions. [2018-12-08 12:18:46,560 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-08 12:18:46,561 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 38 [2018-12-08 12:18:46,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 175 states and 210 transitions. [2018-12-08 12:18:46,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:18:46,561 INFO L705 BuchiCegarLoop]: Abstraction has 175 states and 210 transitions. [2018-12-08 12:18:46,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states and 210 transitions. [2018-12-08 12:18:46,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 159. [2018-12-08 12:18:46,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 159 states. [2018-12-08 12:18:46,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 194 transitions. [2018-12-08 12:18:46,567 INFO L728 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2018-12-08 12:18:46,567 INFO L608 BuchiCegarLoop]: Abstraction has 159 states and 194 transitions. [2018-12-08 12:18:46,567 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-08 12:18:46,568 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 159 states and 194 transitions. [2018-12-08 12:18:46,568 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-08 12:18:46,568 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:18:46,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:18:46,569 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1] [2018-12-08 12:18:46,569 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:18:46,569 INFO L794 eck$LassoCheckResult]: Stem: 2848#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2842#L-1 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; 2843#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2881#L551-1 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; 2907#L551-3 main_#t~short9 := main_#t~short7; 2905#L551-4 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; 2902#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 2903#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2950#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; 2948#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2949#L551-1 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; 2947#L551-3 main_#t~short9 := main_#t~short7; 2945#L551-4 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; 2944#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 2857#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2882#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; 2849#L554-2 [2018-12-08 12:18:46,569 INFO L796 eck$LassoCheckResult]: Loop: 2849#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2850#L551-1 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; 2995#L551-3 main_#t~short9 := main_#t~short7; 2841#L551-4 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; 2888#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 2866#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2867#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; 2849#L554-2 [2018-12-08 12:18:46,569 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:46,570 INFO L82 PathProgramCache]: Analyzing trace with hash -996537471, now seen corresponding path program 1 times [2018-12-08 12:18:46,570 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:46,570 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:46,570 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,570 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:46,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,584 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:46,584 INFO L82 PathProgramCache]: Analyzing trace with hash -334846251, now seen corresponding path program 2 times [2018-12-08 12:18:46,584 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:46,584 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,585 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:18:46,585 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,590 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:46,591 INFO L82 PathProgramCache]: Analyzing trace with hash 1135913813, now seen corresponding path program 2 times [2018-12-08 12:18:46,591 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:46,591 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,591 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:46,591 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:46,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:46,742 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification. DAG size of input: 84 DAG size of output: 65 [2018-12-08 12:18:47,197 WARN L180 SmtUtils]: Spent 419.00 ms on a formula simplification. DAG size of input: 179 DAG size of output: 124 [2018-12-08 12:18:47,301 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:18:47,301 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:18:47,301 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:18:47,301 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:18:47,301 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:18:47,301 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:18:47,301 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:18:47,301 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:18:47,301 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration8_Lasso [2018-12-08 12:18:47,301 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:18:47,301 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:18:47,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-12-08 12:18:47,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-12-08 12:18:47,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,307 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,311 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,314 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,316 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,320 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,524 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,525 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,527 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:47,751 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:18:47,751 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:18:47,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,751 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,751 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,751 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,752 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,752 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,752 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,753 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,754 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,754 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,754 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,754 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,755 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,755 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,755 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,755 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,756 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,756 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,757 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,757 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,757 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,757 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,757 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,758 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,758 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,758 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,759 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,759 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,759 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,759 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,759 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,759 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,760 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,761 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:47,761 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:47,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,762 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,762 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,763 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,763 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,763 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,763 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,764 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,764 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,764 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,764 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,764 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,765 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,765 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,765 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,766 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,766 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,766 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,767 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,767 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,767 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,767 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,768 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,768 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,769 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,770 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,770 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:47,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,770 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,770 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,770 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:47,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:47,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,771 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,771 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,771 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,771 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,771 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,772 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,772 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,774 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,774 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,774 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,774 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,774 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,775 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,775 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,777 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:47,777 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,777 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,778 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,778 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,779 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,779 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,779 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,780 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,780 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:47,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-12-08 12:18:47,782 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:47,782 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:47,782 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:47,783 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:47,783 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:47,783 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:47,785 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:18:47,786 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:18:47,786 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:18:47,787 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:18:47,787 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:18:47,787 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:18:47,788 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)_7) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_7 Supporting invariants [] [2018-12-08 12:18:47,846 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:18:47,847 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:18:47,860 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:47,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:47,870 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:47,873 INFO L478 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-12-08 12:18:47,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:47,878 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:47,879 INFO L478 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-12-08 12:18:47,879 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:47,881 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:47,883 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:47,883 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:47,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:47,889 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:47,933 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:47,933 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-12-08 12:18:47,933 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46 Second operand 7 states. [2018-12-08 12:18:47,991 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 159 states and 194 transitions. cyclomatic complexity: 46. Second operand 7 states. Result 249 states and 297 transitions. Complement of second has 12 states. [2018-12-08 12:18:47,991 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-12-08 12:18:47,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2018-12-08 12:18:47,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 20 transitions. [2018-12-08 12:18:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 7 letters. [2018-12-08 12:18:47,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:47,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 23 letters. Loop has 7 letters. [2018-12-08 12:18:47,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:47,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 20 transitions. Stem has 16 letters. Loop has 14 letters. [2018-12-08 12:18:47,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:47,992 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 249 states and 297 transitions. [2018-12-08 12:18:47,993 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-08 12:18:47,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 249 states to 219 states and 261 transitions. [2018-12-08 12:18:47,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 44 [2018-12-08 12:18:47,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 49 [2018-12-08 12:18:47,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 219 states and 261 transitions. [2018-12-08 12:18:47,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:18:47,995 INFO L705 BuchiCegarLoop]: Abstraction has 219 states and 261 transitions. [2018-12-08 12:18:47,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states and 261 transitions. [2018-12-08 12:18:48,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 200. [2018-12-08 12:18:48,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 200 states. [2018-12-08 12:18:48,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 242 transitions. [2018-12-08 12:18:48,001 INFO L728 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2018-12-08 12:18:48,001 INFO L608 BuchiCegarLoop]: Abstraction has 200 states and 242 transitions. [2018-12-08 12:18:48,001 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-08 12:18:48,001 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 200 states and 242 transitions. [2018-12-08 12:18:48,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2018-12-08 12:18:48,002 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:18:48,002 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:18:48,003 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2018-12-08 12:18:48,003 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:18:48,003 INFO L794 eck$LassoCheckResult]: Stem: 3456#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3450#L-1 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; 3451#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3494#L551-1 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; 3524#L551-3 main_#t~short9 := main_#t~short7; 3523#L551-4 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; 3469#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 3470#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3466#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; 3596#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3594#L551-1 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; 3452#L551-3 main_#t~short9 := main_#t~short7; 3453#L551-4 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; 3568#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 3530#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3531#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; 3590#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3472#L551-1 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; 3473#L551-3 main_#t~short9 := main_#t~short7; 3647#L551-4 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; 3533#L551-6 [2018-12-08 12:18:48,003 INFO L796 eck$LassoCheckResult]: Loop: 3533#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 3478#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3479#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; 3476#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3637#L551-1 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; 3636#L551-3 main_#t~short9 := main_#t~short7; 3634#L551-4 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; 3533#L551-6 [2018-12-08 12:18:48,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331691, now seen corresponding path program 3 times [2018-12-08 12:18:48,004 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:48,004 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,004 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:48,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,026 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:48,026 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 2 times [2018-12-08 12:18:48,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:48,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,027 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:48,027 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:48,033 INFO L82 PathProgramCache]: Analyzing trace with hash 742589689, now seen corresponding path program 4 times [2018-12-08 12:18:48,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:48,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:48,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:48,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:48,174 WARN L180 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2018-12-08 12:18:48,854 WARN L180 SmtUtils]: Spent 581.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 144 [2018-12-08 12:18:49,520 WARN L180 SmtUtils]: Spent 653.00 ms on a formula simplification. DAG size of input: 104 DAG size of output: 104 [2018-12-08 12:18:49,523 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:18:49,523 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:18:49,523 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:18:49,523 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:18:49,523 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:18:49,523 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:18:49,523 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:18:49,523 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:18:49,523 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration9_Lasso [2018-12-08 12:18:49,523 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:18:49,523 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:18:49,526 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,528 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,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-12-08 12:18:49,534 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,535 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,536 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:49,921 WARN L180 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 81 [2018-12-08 12:18:50,024 WARN L180 SmtUtils]: Spent 100.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2018-12-08 12:18:50,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,025 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,027 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,028 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,029 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,030 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,032 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:50,363 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:18:50,364 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:18:50,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,364 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,364 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,364 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,366 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,366 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,366 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,367 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,367 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,368 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,369 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,369 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,370 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,370 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,370 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,370 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,370 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,370 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,370 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,371 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,371 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,371 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,371 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,372 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,372 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,372 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,374 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,374 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,374 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,378 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,379 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,379 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,380 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,380 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,380 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,380 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,381 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:50,381 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,382 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,383 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:50,383 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,384 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,384 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:50,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,385 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:50,385 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,395 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,396 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:50,396 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,398 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,398 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,399 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,399 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,400 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,400 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,400 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,400 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,401 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,401 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,402 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,402 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,402 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,403 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,403 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,403 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,403 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,403 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,405 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,406 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,406 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,407 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,407 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,407 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,408 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,408 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,408 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,408 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,408 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,409 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,409 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,410 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,410 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,410 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,410 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,410 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:50,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,411 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:50,411 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:50,411 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:50,412 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,412 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-08 12:18:50,412 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,412 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,413 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,413 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,413 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,414 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,415 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,415 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,415 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,416 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,416 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,417 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,417 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,417 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,417 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,417 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,418 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,418 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,419 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,420 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,421 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,422 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,422 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,424 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,426 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,426 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,433 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,433 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,434 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,436 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,436 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,436 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,438 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,438 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,439 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,439 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,441 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,441 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:50,441 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,442 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-08 12:18:50,442 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-08 12:18:50,465 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,466 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,466 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,466 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,466 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,466 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,466 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,468 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,468 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,468 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,469 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,469 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,469 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,469 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,470 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,470 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,471 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,471 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,473 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,474 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,474 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,474 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,474 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,475 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,475 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,477 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,478 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,478 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,478 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,478 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,480 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,480 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,480 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,480 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,480 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,481 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,481 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,481 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,482 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,482 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,482 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,482 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,482 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,483 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,483 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,483 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,483 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,483 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,484 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,484 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,484 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,484 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,484 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,484 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,484 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,484 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,485 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,485 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,485 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,485 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,485 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,485 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,485 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,486 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,486 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,486 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,486 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,486 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,487 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,487 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,488 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-08 12:18:50,488 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,488 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,488 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,488 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,488 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,489 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,489 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,490 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,490 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,490 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,491 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,491 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,491 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,491 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,491 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,492 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,492 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,493 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,493 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,493 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,495 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,495 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,495 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,496 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,496 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,497 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,497 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,497 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,498 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,498 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,498 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,498 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,499 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,499 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,499 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,499 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,500 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,500 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,500 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,500 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,502 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,503 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,503 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,503 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,503 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,504 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,504 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,512 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,512 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,513 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,515 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,515 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,515 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,515 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,516 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:50,516 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,519 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,520 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:50,520 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,522 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,522 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,523 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,523 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,523 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:50,523 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,525 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-12-08 12:18:50,525 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-12-08 12:18:50,544 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,544 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,544 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,545 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-12-08 12:18:50,545 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,547 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,547 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,548 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,548 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,549 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,549 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,549 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,550 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,550 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,550 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,550 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,551 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,554 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,555 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,555 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,558 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,558 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,558 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,558 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,559 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,559 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,562 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,562 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,563 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,563 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,563 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,563 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,564 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,564 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,564 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,565 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,565 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,566 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,566 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,567 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,567 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,567 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,568 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,568 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,568 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,568 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:50,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,569 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,569 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,569 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-08 12:18:50,570 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,570 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-12-08 12:18:50,571 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,571 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-08 12:18:50,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-12-08 12:18:50,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,571 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,572 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,572 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,573 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,574 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,574 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,574 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,574 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,574 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,575 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,575 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,576 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,576 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,576 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,576 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,576 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,576 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,578 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,578 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,578 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,578 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,578 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,579 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,579 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,580 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,580 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,580 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,580 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,580 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,580 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,580 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,581 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,581 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,581 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,581 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,582 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,582 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,582 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,582 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,582 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,585 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,585 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,585 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,586 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,586 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,587 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,588 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,596 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,596 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,596 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,596 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,596 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,597 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,597 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,599 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,600 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,600 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,600 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,601 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:50,601 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,603 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,603 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,603 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,604 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,604 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:50,604 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,606 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,607 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,607 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,607 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:50,607 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,609 INFO L402 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2018-12-08 12:18:50,610 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-12-08 12:18:50,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,637 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,637 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,637 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,638 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-12-08 12:18:50,638 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,640 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,640 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,641 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,641 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,642 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,642 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,643 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,643 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,646 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,646 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,646 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,646 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,650 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,650 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,650 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,650 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,651 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,651 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,653 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,653 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,654 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,654 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,654 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,655 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,655 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,655 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,656 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,656 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,656 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,656 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,656 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,657 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,658 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,671 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,671 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,671 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,672 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,672 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,672 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,672 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,672 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,672 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,672 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,673 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,673 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,673 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-08 12:18:50,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,674 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:50,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,674 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-08 12:18:50,675 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-12-08 12:18:50,675 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-12-08 12:18:50,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,676 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-08 12:18:50,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-12-08 12:18:50,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,701 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,701 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,702 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,702 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,704 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,704 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,704 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,704 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,705 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,706 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,706 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,706 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,706 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,731 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,731 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,731 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,731 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,732 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,733 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,733 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,733 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,733 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,733 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,733 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,733 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,734 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,734 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,734 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:50,734 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,734 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,734 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,734 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-08 12:18:50,734 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:50,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,735 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,761 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,761 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,761 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,764 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,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-12-08 12:18:50,765 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,765 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,766 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,768 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,768 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,778 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,778 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:50,778 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,778 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,779 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-12-08 12:18:50,779 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,783 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,783 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,783 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,784 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,784 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,793 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,793 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,793 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,793 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,793 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:50,793 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,794 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-08 12:18:50,794 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-12-08 12:18:50,797 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:50,797 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:50,797 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-08 12:18:50,798 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-08 12:18:50,798 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:50,798 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:50,798 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-08 12:18:50,801 INFO L402 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2018-12-08 12:18:50,801 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-12-08 12:18:50,849 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:18:50,893 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2018-12-08 12:18:50,893 INFO L444 ModelExtractionUtils]: 23 out of 34 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:18:50,893 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:18:50,895 INFO L440 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2018-12-08 12:18:50,896 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:18:50,896 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*ULTIMATE.start_main_#t~mem8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [1*ULTIMATE.start_main_#t~mem8 - 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 >= 0] [2018-12-08 12:18:51,009 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2018-12-08 12:18:51,037 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:51,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,053 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,056 INFO L478 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-12-08 12:18:51,067 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,068 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,069 INFO L478 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-12-08 12:18:51,069 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,072 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,077 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,077 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:51,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,093 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,120 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,120 INFO L478 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-12-08 12:18:51,123 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,124 INFO L478 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-12-08 12:18:51,124 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,136 INFO L478 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-12-08 12:18:51,138 INFO L478 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-12-08 12:18:51,138 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,143 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,152 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,173 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,174 INFO L478 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-12-08 12:18:51,176 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,177 INFO L478 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-12-08 12:18:51,177 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,186 INFO L478 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-12-08 12:18:51,188 INFO L478 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-12-08 12:18:51,188 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,191 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,196 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,207 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:51,208 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:115, output treesize:41 [2018-12-08 12:18:51,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:51,224 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-12-08 12:18:51,224 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-12-08 12:18:51,334 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 10 states. [2018-12-08 12:18:51,334 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-12-08 12:18:51,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:18:51,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-08 12:18:51,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-08 12:18:51,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:51,335 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:51,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:51,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,366 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,368 INFO L478 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-12-08 12:18:51,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,374 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,375 INFO L478 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-12-08 12:18:51,375 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,378 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,381 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,381 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:51,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,395 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,419 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,420 INFO L478 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-12-08 12:18:51,428 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,428 INFO L478 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-12-08 12:18:51,428 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,442 INFO L478 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-12-08 12:18:51,444 INFO L478 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-12-08 12:18:51,444 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,448 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,454 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,477 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,478 INFO L478 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-12-08 12:18:51,480 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,480 INFO L478 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-12-08 12:18:51,481 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,492 INFO L478 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-12-08 12:18:51,494 INFO L478 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-12-08 12:18:51,494 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,498 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,503 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,604 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:51,604 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:115, output treesize:41 [2018-12-08 12:18:51,622 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:51,622 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-12-08 12:18:51,622 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-12-08 12:18:51,713 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 302 states and 359 transitions. Complement of second has 10 states. [2018-12-08 12:18:51,714 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-12-08 12:18:51,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:18:51,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2018-12-08 12:18:51,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-08 12:18:51,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:51,714 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:51,731 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:51,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,743 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,745 INFO L478 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-12-08 12:18:51,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,750 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,750 INFO L478 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-12-08 12:18:51,750 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,753 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,756 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,756 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:51,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:51,768 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:51,789 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,789 INFO L478 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-12-08 12:18:51,791 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,792 INFO L478 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-12-08 12:18:51,792 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,800 INFO L478 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-12-08 12:18:51,801 INFO L478 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-12-08 12:18:51,801 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,805 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,810 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,828 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,828 INFO L478 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-12-08 12:18:51,830 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:51,831 INFO L478 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-12-08 12:18:51,831 INFO L267 ElimStorePlain]: Start of recursive call 7: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,840 INFO L478 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-12-08 12:18:51,841 INFO L478 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-12-08 12:18:51,841 INFO L267 ElimStorePlain]: Start of recursive call 9: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,845 INFO L267 ElimStorePlain]: Start of recursive call 8: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,850 INFO L267 ElimStorePlain]: Start of recursive call 6: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:51,862 INFO L267 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 2 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-12-08 12:18:51,862 INFO L202 ElimStorePlain]: Needed 9 recursive calls to eliminate 6 variables, input treesize:115, output treesize:41 [2018-12-08 12:18:51,878 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:51,878 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-12-08 12:18:51,878 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56 Second operand 5 states. [2018-12-08 12:18:51,987 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 200 states and 242 transitions. cyclomatic complexity: 56. Second operand 5 states. Result 411 states and 491 transitions. Complement of second has 9 states. [2018-12-08 12:18:51,988 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-12-08 12:18:51,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-12-08 12:18:51,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 25 transitions. [2018-12-08 12:18:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2018-12-08 12:18:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2018-12-08 12:18:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:51,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2018-12-08 12:18:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:51,989 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 491 transitions. [2018-12-08 12:18:51,991 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2018-12-08 12:18:51,993 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 255 states and 305 transitions. [2018-12-08 12:18:51,993 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 37 [2018-12-08 12:18:51,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2018-12-08 12:18:51,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 255 states and 305 transitions. [2018-12-08 12:18:51,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:18:51,993 INFO L705 BuchiCegarLoop]: Abstraction has 255 states and 305 transitions. [2018-12-08 12:18:51,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 255 states and 305 transitions. [2018-12-08 12:18:51,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 255 to 226. [2018-12-08 12:18:51,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-08 12:18:51,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 274 transitions. [2018-12-08 12:18:51,999 INFO L728 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2018-12-08 12:18:51,999 INFO L608 BuchiCegarLoop]: Abstraction has 226 states and 274 transitions. [2018-12-08 12:18:51,999 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-08 12:18:51,999 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 226 states and 274 transitions. [2018-12-08 12:18:52,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 48 [2018-12-08 12:18:52,000 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:18:52,000 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:18:52,001 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-12-08 12:18:52,001 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-08 12:18:52,001 INFO L794 eck$LassoCheckResult]: Stem: 5091#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5085#L-1 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; 5086#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5167#L551-1 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; 5165#L551-3 main_#t~short9 := main_#t~short7; 5161#L551-4 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; 5158#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 5104#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5224#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; 5221#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5209#L551-1 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; 5210#L551-3 main_#t~short9 := main_#t~short7; 5235#L551-4 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; 5233#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 5231#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5219#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; 5220#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5229#L551-1 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; 5273#L551-3 main_#t~short9 := main_#t~short7; 5117#L551-4 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; 5118#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 5100#L552 [2018-12-08 12:18:52,001 INFO L796 eck$LassoCheckResult]: Loop: 5100#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5101#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; 5127#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5126#L551-1 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; 5124#L551-3 main_#t~short9 := main_#t~short7; 5125#L551-4 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; 5244#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 5100#L552 [2018-12-08 12:18:52,001 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:52,001 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 5 times [2018-12-08 12:18:52,001 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:52,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,002 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:52,002 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:52,016 INFO L82 PathProgramCache]: Analyzing trace with hash -745311761, now seen corresponding path program 3 times [2018-12-08 12:18:52,016 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:52,017 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:52,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,019 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,022 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:52,022 INFO L82 PathProgramCache]: Analyzing trace with hash 1488185602, now seen corresponding path program 6 times [2018-12-08 12:18:52,022 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:52,022 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,023 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:52,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:52,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:52,155 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2018-12-08 12:18:52,691 WARN L180 SmtUtils]: Spent 507.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 144 [2018-12-08 12:18:52,789 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:18:52,789 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:18:52,789 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:18:52,789 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:18:52,789 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:18:52,789 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:18:52,789 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:18:52,789 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:18:52,789 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration10_Lasso [2018-12-08 12:18:52,789 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:18:52,789 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:18:52,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-12-08 12:18:52,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:52,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-12-08 12:18:52,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-12-08 12:18:52,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-12-08 12:18:53,024 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2018-12-08 12:18:53,115 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,117 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,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-12-08 12:18:53,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,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-12-08 12:18:53,124 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,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-12-08 12:18:53,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-12-08 12:18:53,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,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-12-08 12:18:53,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:53,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-12-08 12:18:53,418 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:18:53,418 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:18:53,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:53,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,418 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:53,419 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,419 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:53,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:53,419 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,419 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,419 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:53,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:53,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:53,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,420 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:53,420 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,420 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,420 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,420 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:53,421 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:53,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,421 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,421 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,421 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,422 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,422 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,422 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,422 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,422 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,422 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,423 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,423 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,424 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,424 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,424 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,425 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,425 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,425 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:53,425 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,425 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,425 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:53,426 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,427 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,427 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,427 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,428 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,429 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:53,429 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,429 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,429 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:53,429 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,431 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,431 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,431 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,431 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,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-12-08 12:18:53,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,433 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,434 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,434 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,434 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,434 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,435 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,435 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:53,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,435 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,435 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:53,435 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,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-12-08 12:18:53,436 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,436 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,437 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,437 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:53,441 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:53,441 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:53,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:53,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:53,441 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:53,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:53,441 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:53,443 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:18:53,444 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:18:53,444 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2018-12-08 12:18:53,445 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:18:53,445 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:18:53,445 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:18:53,445 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-12-08 12:18:53,494 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:18:53,495 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:18:53,511 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:53,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:53,523 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:53,525 INFO L478 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-12-08 12:18:53,529 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,530 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,530 INFO L478 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-12-08 12:18:53,530 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,532 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,535 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,535 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:53,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:53,541 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:53,544 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,544 INFO L478 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-12-08 12:18:53,547 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,547 INFO L478 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-12-08 12:18:53,547 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,555 INFO L478 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-12-08 12:18:53,557 INFO L478 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-12-08 12:18:53,557 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,562 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,565 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,569 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,569 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-08 12:18:53,621 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:53,621 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-12-08 12:18:53,621 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-12-08 12:18:53,698 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 339 states and 408 transitions. Complement of second has 12 states. [2018-12-08 12:18:53,699 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-12-08 12:18:53,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:53,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 22 transitions. [2018-12-08 12:18:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 12:18:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:53,699 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:53,713 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:53,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:53,726 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:53,727 INFO L478 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-12-08 12:18:53,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,734 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,735 INFO L478 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-12-08 12:18:53,735 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,737 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,740 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,740 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:53,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:53,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:53,749 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,750 INFO L478 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-12-08 12:18:53,752 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,753 INFO L478 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-12-08 12:18:53,753 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,766 INFO L478 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-12-08 12:18:53,768 INFO L478 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-12-08 12:18:53,768 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,771 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,774 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,778 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,778 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-08 12:18:53,827 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:53,827 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 5 loop predicates [2018-12-08 12:18:53,828 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-12-08 12:18:53,936 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 347 states and 415 transitions. Complement of second has 14 states. [2018-12-08 12:18:53,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 8 states 2 stem states 5 non-accepting loop states 1 accepting loop states [2018-12-08 12:18:53,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:53,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 22 transitions. [2018-12-08 12:18:53,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 8 states and 22 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 12:18:53,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:53,936 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-12-08 12:18:53,957 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:53,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:53,986 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:53,988 INFO L478 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-12-08 12:18:53,992 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,993 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:53,993 INFO L478 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-12-08 12:18:53,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:53,997 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,000 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,000 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:6 [2018-12-08 12:18:54,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:54,005 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:54,008 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:54,008 INFO L478 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-12-08 12:18:54,010 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:54,010 INFO L478 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-12-08 12:18:54,011 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,017 INFO L478 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-12-08 12:18:54,018 INFO L478 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-12-08 12:18:54,018 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,021 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,024 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,027 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:54,027 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2018-12-08 12:18:54,074 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 12:18:54,074 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 5 loop predicates [2018-12-08 12:18:54,074 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62 Second operand 8 states. [2018-12-08 12:18:54,150 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 226 states and 274 transitions. cyclomatic complexity: 62. Second operand 8 states. Result 538 states and 658 transitions. Complement of second has 14 states. [2018-12-08 12:18:54,150 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-12-08 12:18:54,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:54,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 27 transitions. [2018-12-08 12:18:54,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 7 letters. [2018-12-08 12:18:54,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:54,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 28 letters. Loop has 7 letters. [2018-12-08 12:18:54,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:54,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 27 transitions. Stem has 21 letters. Loop has 14 letters. [2018-12-08 12:18:54,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:54,152 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 538 states and 658 transitions. [2018-12-08 12:18:54,154 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 54 [2018-12-08 12:18:54,156 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 538 states to 329 states and 391 transitions. [2018-12-08 12:18:54,156 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 19 [2018-12-08 12:18:54,156 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 19 [2018-12-08 12:18:54,156 INFO L73 IsDeterministic]: Start isDeterministic. Operand 329 states and 391 transitions. [2018-12-08 12:18:54,156 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-12-08 12:18:54,157 INFO L705 BuchiCegarLoop]: Abstraction has 329 states and 391 transitions. [2018-12-08 12:18:54,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 329 states and 391 transitions. [2018-12-08 12:18:54,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 329 to 266. [2018-12-08 12:18:54,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 266 states. [2018-12-08 12:18:54,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 266 states to 266 states and 323 transitions. [2018-12-08 12:18:54,162 INFO L728 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2018-12-08 12:18:54,162 INFO L608 BuchiCegarLoop]: Abstraction has 266 states and 323 transitions. [2018-12-08 12:18:54,162 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-08 12:18:54,162 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 266 states and 323 transitions. [2018-12-08 12:18:54,163 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2018-12-08 12:18:54,163 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-08 12:18:54,163 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-08 12:18:54,164 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2018-12-08 12:18:54,164 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2018-12-08 12:18:54,164 INFO L794 eck$LassoCheckResult]: Stem: 6984#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 6979#L-1 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; 6980#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 6990#L551-1 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; 6975#L551-3 main_#t~short9 := main_#t~short7; 6976#L551-4 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; 6993#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 6994#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7022#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; 7023#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7033#L551-1 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; 7072#L551-3 main_#t~short9 := main_#t~short7; 7064#L551-4 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; 7063#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 7059#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7060#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; 7055#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7056#L551-1 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; 7007#L551-3 main_#t~short9 := main_#t~short7; 7008#L551-4 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; 7001#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 7003#L552 [2018-12-08 12:18:54,164 INFO L796 eck$LassoCheckResult]: Loop: 7003#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7140#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; 7139#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7138#L551-1 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; 7137#L551-3 main_#t~short9 := main_#t~short7; 7136#L551-4 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; 7134#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 7002#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 7014#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; 7011#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 7009#L551-1 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; 7010#L551-3 main_#t~short9 := main_#t~short7; 7203#L551-4 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; 7001#L551-6 assume !!main_#t~short9;havoc main_#t~mem5;havoc main_#t~mem6;havoc main_#t~short7;havoc main_#t~short9;havoc main_#t~mem8; 7003#L552 [2018-12-08 12:18:54,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:54,164 INFO L82 PathProgramCache]: Analyzing trace with hash -740226994, now seen corresponding path program 7 times [2018-12-08 12:18:54,164 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:54,164 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,165 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-08 12:18:54,165 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,176 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,178 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:54,178 INFO L82 PathProgramCache]: Analyzing trace with hash 1613777279, now seen corresponding path program 1 times [2018-12-08 12:18:54,178 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:54,178 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,179 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:18:54,179 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:54,187 INFO L82 PathProgramCache]: Analyzing trace with hash 950159116, now seen corresponding path program 8 times [2018-12-08 12:18:54,187 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-08 12:18:54,187 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-08 12:18:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,188 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 12:18:54,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 12:18:54,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-08 12:18:54,470 WARN L180 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2018-12-08 12:18:55,260 WARN L180 SmtUtils]: Spent 741.00 ms on a formula simplification. DAG size of input: 217 DAG size of output: 141 [2018-12-08 12:18:55,350 INFO L216 LassoAnalysis]: Preferences: [2018-12-08 12:18:55,350 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-08 12:18:55,350 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-08 12:18:55,350 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-08 12:18:55,350 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-08 12:18:55,350 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-08 12:18:55,350 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-08 12:18:55,350 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-08 12:18:55,350 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca_true-termination.c.i_Iteration11_Lasso [2018-12-08 12:18:55,350 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-08 12:18:55,350 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-08 12:18:55,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,362 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,368 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,586 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-08 12:18:55,831 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-08 12:18:55,831 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-08 12:18:55,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-12-08 12:18:55,831 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,831 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,832 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,832 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,833 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,833 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,833 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,834 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,834 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,834 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,835 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,835 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,835 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,835 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,835 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,835 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,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-12-08 12:18:55,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,836 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,836 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,836 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,836 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,837 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,837 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,837 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,837 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,837 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,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-12-08 12:18:55,838 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,838 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,838 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,838 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,838 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,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-12-08 12:18:55,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,839 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,839 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,839 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,839 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,839 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,840 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,840 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,840 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,840 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,840 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,840 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,841 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,841 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,841 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,841 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,841 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,841 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,842 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,842 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,842 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,842 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,842 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,843 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,843 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,843 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,843 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,843 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,843 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,844 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-08 12:18:55,844 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,844 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-08 12:18:55,844 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,844 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,844 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,844 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,845 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,845 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,845 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,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-12-08 12:18:55,845 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,845 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-08 12:18:55,845 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,845 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,846 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-08 12:18:55,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-08 12:18:55,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,846 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,847 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,847 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,847 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,848 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,848 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,848 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,848 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,848 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,849 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,849 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-12-08 12:18:55,849 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,849 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,849 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-08 12:18:55,849 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-08 12:18:55,850 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-08 12:18:55,850 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-08 12:18:55,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-08 12:18:55,851 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-08 12:18:55,851 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-08 12:18:55,851 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-08 12:18:55,851 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-12-08 12:18:55,852 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-12-08 12:18:55,853 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-12-08 12:18:55,853 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-12-08 12:18:55,853 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-12-08 12:18:55,853 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-12-08 12:18:55,854 INFO L518 LassoAnalysis]: Proved termination. [2018-12-08 12:18:55,854 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)_10) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_10 Supporting invariants [] [2018-12-08 12:18:55,924 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2018-12-08 12:18:55,927 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-08 12:18:55,941 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 12:18:55,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:55,953 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:55,959 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:55,960 INFO L478 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-12-08 12:18:55,969 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:55,970 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:55,970 INFO L478 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-12-08 12:18:55,970 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:55,973 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:55,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:55,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2018-12-08 12:18:55,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 12:18:55,991 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-08 12:18:55,994 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:55,994 INFO L478 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-12-08 12:18:55,996 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:55,997 INFO L478 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-12-08 12:18:55,997 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,004 INFO L478 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-12-08 12:18:56,005 INFO L478 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-12-08 12:18:56,005 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,008 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,011 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,015 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,015 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:55, output treesize:18 [2018-12-08 12:18:56,073 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:56,074 INFO L478 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 56 treesize of output 54 [2018-12-08 12:18:56,076 INFO L701 Elim1Store]: detected not equals via solver [2018-12-08 12:18:56,077 INFO L478 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-12-08 12:18:56,077 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,085 INFO L478 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 28 treesize of output 29 [2018-12-08 12:18:56,086 INFO L478 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-12-08 12:18:56,087 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,091 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,094 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,099 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-08 12:18:56,099 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 4 variables, input treesize:64, output treesize:25 [2018-12-08 12:18:56,099 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-08 12:18:56,099 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-12-08 12:18:56,099 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74 Second operand 8 states. [2018-12-08 12:18:56,173 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 266 states and 323 transitions. cyclomatic complexity: 74. Second operand 8 states. Result 632 states and 767 transitions. Complement of second has 11 states. [2018-12-08 12:18:56,173 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-12-08 12:18:56,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2018-12-08 12:18:56,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2018-12-08 12:18:56,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2018-12-08 12:18:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:56,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2018-12-08 12:18:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:56,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2018-12-08 12:18:56,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-12-08 12:18:56,174 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 632 states and 767 transitions. [2018-12-08 12:18:56,177 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:18:56,177 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 632 states to 0 states and 0 transitions. [2018-12-08 12:18:56,177 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2018-12-08 12:18:56,177 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2018-12-08 12:18:56,177 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2018-12-08 12:18:56,177 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-08 12:18:56,177 INFO L705 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:18:56,177 INFO L728 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:18:56,178 INFO L608 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-08 12:18:56,178 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-08 12:18:56,178 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2018-12-08 12:18:56,178 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2018-12-08 12:18:56,178 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2018-12-08 12:18:56,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 08.12 12:18:56 BoogieIcfgContainer [2018-12-08 12:18:56,184 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-08 12:18:56,184 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-08 12:18:56,184 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-08 12:18:56,184 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-08 12:18:56,185 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 12:17:11" (3/4) ... [2018-12-08 12:18:56,188 INFO L147 WitnessPrinter]: No result that supports witness generation found [2018-12-08 12:18:56,188 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-08 12:18:56,188 INFO L168 Benchmark]: Toolchain (without parser) took 105494.05 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 485.5 MB). Free memory was 951.7 MB in the beginning and 867.7 MB in the end (delta: 84.0 MB). Peak memory consumption was 569.5 MB. Max. memory is 11.5 GB. [2018-12-08 12:18:56,189 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:18:56,189 INFO L168 Benchmark]: CACSL2BoogieTranslator took 263.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. [2018-12-08 12:18:56,189 INFO L168 Benchmark]: Boogie Procedure Inliner took 27.85 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-08 12:18:56,189 INFO L168 Benchmark]: Boogie Preprocessor took 14.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:18:56,190 INFO L168 Benchmark]: RCFGBuilder took 157.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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. [2018-12-08 12:18:56,190 INFO L168 Benchmark]: BuchiAutomizer took 105024.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 221.5 MB). Peak memory consumption was 587.4 MB. Max. memory is 11.5 GB. [2018-12-08 12:18:56,190 INFO L168 Benchmark]: Witness Printer took 3.75 ms. Allocated memory is still 1.5 GB. Free memory is still 867.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-08 12:18:56,191 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 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 263.56 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 119.5 MB). Free memory was 951.7 MB in the beginning and 1.1 GB in the end (delta: -157.2 MB). Peak memory consumption was 25.8 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 27.85 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 14.53 ms. Allocated memory is still 1.1 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 157.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: 17.0 MB). Peak memory consumption was 17.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 105024.23 ms. Allocated memory was 1.1 GB in the beginning and 1.5 GB in the end (delta: 366.0 MB). Free memory was 1.1 GB in the beginning and 867.7 MB in the end (delta: 221.5 MB). Peak memory consumption was 587.4 MB. Max. memory is 11.5 GB. * Witness Printer took 3.75 ms. Allocated memory is still 1.5 GB. Free memory is still 867.7 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 11 terminating modules (1 trivial, 6 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 4 locations. One deterministic module has 2-phase ranking function (if aux-z-aux > 0 then 1 else 0), (if aux-z-aux > 0 then aux-z-aux else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) 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[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 org.eclipse.cdt.internal.core.dom.parser.c.CASTIdExpression@2bbcd802 and consists of 8 locations. One nondeterministic module has 2-phase ranking function (if aux-z-aux > 0 then 1 else 0), (if aux-z-aux > 0 then aux-z-aux else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 6 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 104.9s and 12 iterations. TraceHistogramMax:3. Analysis of lassos took 14.9s. Construction of modules took 84.5s. Büchi inclusion checks took 5.3s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 10. Automata minimization 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 174 StatesRemovedByMinimization, 9 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 266 states and ocurred in iteration 10. Nontrivial modules had stage [6, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 12/13 HoareTripleCheckerStatistics: 173 SDtfs, 340 SDslu, 133 SDs, 0 SdLazy, 615 SolverSat, 122 SolverUnsat, 7 SolverUnknown, 0 SolverNotchecked, 84.5s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso10 LassoPreprocessingBenchmarks: Lassos: inital430 mio100 ax105 hnf99 lsp82 ukn61 mio100 lsp36 div100 bol101 ite100 ukn100 eq189 hnf88 smp98 dnf113 smp91 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 22ms 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...