./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i -s /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/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.24-cad4683 [2019-11-15 20:39:04,931 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 20:39:04,933 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 20:39:04,951 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 20:39:04,951 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 20:39:04,953 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 20:39:04,956 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 20:39:04,967 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 20:39:04,973 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 20:39:04,977 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 20:39:04,979 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 20:39:04,981 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 20:39:04,982 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 20:39:04,984 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 20:39:04,985 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 20:39:04,987 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 20:39:04,987 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 20:39:04,990 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 20:39:04,993 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 20:39:04,999 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 20:39:05,003 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 20:39:05,005 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 20:39:05,009 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 20:39:05,009 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 20:39:05,013 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 20:39:05,014 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 20:39:05,014 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 20:39:05,016 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 20:39:05,016 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 20:39:05,018 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 20:39:05,018 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 20:39:05,019 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 20:39:05,020 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 20:39:05,021 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 20:39:05,022 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 20:39:05,023 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 20:39:05,024 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 20:39:05,024 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 20:39:05,024 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 20:39:05,025 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 20:39:05,026 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 20:39:05,027 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2019-11-15 20:39:05,060 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 20:39:05,071 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 20:39:05,073 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 20:39:05,073 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 20:39:05,073 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 20:39:05,074 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2019-11-15 20:39:05,074 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2019-11-15 20:39:05,074 INFO L138 SettingsManager]: * Use old map elimination=false [2019-11-15 20:39:05,074 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2019-11-15 20:39:05,075 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2019-11-15 20:39:05,075 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2019-11-15 20:39:05,075 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 20:39:05,075 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2019-11-15 20:39:05,076 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 20:39:05,076 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 20:39:05,076 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2019-11-15 20:39:05,076 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2019-11-15 20:39:05,077 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2019-11-15 20:39:05,077 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 20:39:05,077 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2019-11-15 20:39:05,077 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 20:39:05,078 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2019-11-15 20:39:05,078 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 20:39:05,078 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 20:39:05,079 INFO L138 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2019-11-15 20:39:05,079 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 20:39:05,079 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 20:39:05,079 INFO L138 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2019-11-15 20:39:05,081 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2019-11-15 20:39:05,081 INFO L138 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/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/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 [2019-11-15 20:39:05,111 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 20:39:05,124 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 20:39:05,127 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 20:39:05,129 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 20:39:05,129 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 20:39:05,130 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/../../sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2019-11-15 20:39:05,203 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/data/5db514103/93aa3e40b0b0412b86a30281998af84d/FLAG54ac5bf3c [2019-11-15 20:39:05,742 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 20:39:05,743 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/sv-benchmarks/c/termination-memory-alloca/CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2019-11-15 20:39:05,757 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/data/5db514103/93aa3e40b0b0412b86a30281998af84d/FLAG54ac5bf3c [2019-11-15 20:39:06,043 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/uautomizer/data/5db514103/93aa3e40b0b0412b86a30281998af84d [2019-11-15 20:39:06,046 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 20:39:06,048 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 20:39:06,049 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:06,049 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 20:39:06,053 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 20:39:06,054 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,057 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@27f23af1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06, skipping insertion in model container [2019-11-15 20:39:06,057 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,066 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 20:39:06,106 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 20:39:06,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:06,590 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 20:39:06,628 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 20:39:06,677 INFO L192 MainTranslator]: Completed translation [2019-11-15 20:39:06,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06 WrapperNode [2019-11-15 20:39:06,678 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 20:39:06,679 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:06,679 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 20:39:06,679 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 20:39:06,687 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,701 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 20:39:06,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 20:39:06,718 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 20:39:06,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 20:39:06,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,729 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,729 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,734 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,737 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,739 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... [2019-11-15 20:39:06,741 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 20:39:06,742 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 20:39:06,742 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 20:39:06,742 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 20:39:06,743 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_6f904064-9708-4ecf-81f8-4a22debce4a6/bin/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 [2019-11-15 20:39:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-15 20:39:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-15 20:39:06,805 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-15 20:39:06,806 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-15 20:39:06,807 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 20:39:06,807 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 20:39:07,106 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 20:39:07,106 INFO L284 CfgBuilder]: Removed 5 assume(true) statements. [2019-11-15 20:39:07,107 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:07 BoogieIcfgContainer [2019-11-15 20:39:07,107 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 20:39:07,108 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2019-11-15 20:39:07,108 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2019-11-15 20:39:07,112 INFO L275 PluginConnector]: BuchiAutomizer initialized [2019-11-15 20:39:07,113 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:07,114 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 15.11 08:39:06" (1/3) ... [2019-11-15 20:39:07,115 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a03520f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:07, skipping insertion in model container [2019-11-15 20:39:07,115 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:07,116 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 08:39:06" (2/3) ... [2019-11-15 20:39:07,116 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6a03520f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 15.11 08:39:07, skipping insertion in model container [2019-11-15 20:39:07,116 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2019-11-15 20:39:07,117 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:07" (3/3) ... [2019-11-15 20:39:07,118 INFO L371 chiAutomizerObserver]: Analyzing ICFG CookSeeZuleger-2013TACAS-Fig7b-alloca.i [2019-11-15 20:39:07,175 INFO L356 BuchiCegarLoop]: Interprodecural is true [2019-11-15 20:39:07,175 INFO L357 BuchiCegarLoop]: Hoare is false [2019-11-15 20:39:07,175 INFO L358 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2019-11-15 20:39:07,176 INFO L359 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 20:39:07,176 INFO L360 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 20:39:07,176 INFO L361 BuchiCegarLoop]: Difference is false [2019-11-15 20:39:07,176 INFO L362 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 20:39:07,176 INFO L365 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2019-11-15 20:39:07,192 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 20:39:07,218 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:39:07,218 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:07,218 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:07,228 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:07,228 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:39:07,228 INFO L424 BuchiCegarLoop]: ======== Iteration 1============ [2019-11-15 20:39:07,228 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 13 states. [2019-11-15 20:39:07,230 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:39:07,230 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:07,230 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:07,231 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2019-11-15 20:39:07,231 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:39:07,239 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 11#L554-2true [2019-11-15 20:39:07,239 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:07,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:07,244 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2019-11-15 20:39:07,251 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:07,251 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113380365] [2019-11-15 20:39:07,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,252 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,252 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:07,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,407 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:07,408 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:07,408 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 1 times [2019-11-15 20:39:07,408 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:07,409 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690250325] [2019-11-15 20:39:07,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,409 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,409 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:07,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,458 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:07,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:07,461 INFO L82 PathProgramCache]: Analyzing trace with hash 177626380, now seen corresponding path program 1 times [2019-11-15 20:39:07,461 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:07,461 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983681701] [2019-11-15 20:39:07,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,462 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:07,462 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:07,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:07,548 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:07,902 WARN L191 SmtUtils]: Spent 347.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-15 20:39:08,131 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification that was a NOOP. DAG size: 60 [2019-11-15 20:39:08,267 WARN L191 SmtUtils]: Spent 134.00 ms on a formula simplification that was a NOOP. DAG size: 58 [2019-11-15 20:39:08,283 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:08,284 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:08,284 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:08,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:08,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:08,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:08,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:08,285 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:08,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration1_Lasso [2019-11-15 20:39:08,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:08,287 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:08,328 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,338 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,349 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,364 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,396 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,404 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:08,830 WARN L191 SmtUtils]: Spent 273.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 61 [2019-11-15 20:39:09,034 WARN L191 SmtUtils]: Spent 189.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 20:39:09,035 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:09,038 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:10,299 WARN L191 SmtUtils]: Spent 618.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:39:10,341 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:10,347 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:10,352 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,355 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,355 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,356 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,358 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,359 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,364 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,369 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,369 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,373 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,373 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:10,374 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,374 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:10,375 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,391 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,392 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,393 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,393 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,393 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,393 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,393 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,394 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,394 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,395 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,395 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,396 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,396 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,396 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,396 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,399 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,399 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,402 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,403 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,420 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,420 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,422 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,422 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,427 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,428 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,439 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,439 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,440 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,440 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,444 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,444 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,448 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,449 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,450 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,450 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,453 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,453 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,454 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,454 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,454 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,454 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,455 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,457 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,458 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,459 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,460 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,460 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,461 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,461 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,461 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,462 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,462 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,464 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,464 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,465 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,465 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,465 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,466 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,466 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,467 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,467 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,468 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,468 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,469 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,469 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,471 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,471 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,475 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,475 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,476 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,476 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,476 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,476 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,477 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,477 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,477 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,478 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,479 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,479 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,480 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,480 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,480 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,480 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,481 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,481 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,482 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,482 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,483 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,483 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,484 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,484 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,484 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,484 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,485 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,486 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,486 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,487 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,487 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,487 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,488 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,488 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,488 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,488 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,492 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,493 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,494 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,494 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,494 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,495 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,504 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,505 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,623 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,626 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,626 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,632 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,632 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,672 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,672 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,673 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,673 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,675 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:10,675 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:10,684 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:10,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:10,685 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:10,686 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:10,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:10,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:10,686 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:10,687 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:10,687 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:10,689 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:10,694 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:39:10,694 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:10,696 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:10,696 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2019-11-15 20:39:10,697 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:10,697 INFO L512 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 [] [2019-11-15 20:39:10,786 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:39:10,791 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:39:10,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:10,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:10,838 INFO L256 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:10,839 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:10,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:10,878 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:39:10,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:10,884 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:10,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:10,971 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:39:10,972 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 13 states. Second operand 4 states. [2019-11-15 20:39:11,127 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. [2019-11-15 20:39:11,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2019-11-15 20:39:11,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:39:11,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 31 transitions. [2019-11-15 20:39:11,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 6 letters. [2019-11-15 20:39:11,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 8 letters. Loop has 6 letters. [2019-11-15 20:39:11,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:11,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 31 transitions. Stem has 2 letters. Loop has 12 letters. [2019-11-15 20:39:11,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:11,143 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 60 states and 79 transitions. [2019-11-15 20:39:11,154 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:11,164 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 60 states to 34 states and 50 transitions. [2019-11-15 20:39:11,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 22 [2019-11-15 20:39:11,166 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 23 [2019-11-15 20:39:11,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 50 transitions. [2019-11-15 20:39:11,167 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:39:11,168 INFO L688 BuchiCegarLoop]: Abstraction has 34 states and 50 transitions. [2019-11-15 20:39:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states and 50 transitions. [2019-11-15 20:39:11,203 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 31. [2019-11-15 20:39:11,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2019-11-15 20:39:11,206 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 44 transitions. [2019-11-15 20:39:11,207 INFO L711 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-15 20:39:11,208 INFO L591 BuchiCegarLoop]: Abstraction has 31 states and 44 transitions. [2019-11-15 20:39:11,208 INFO L424 BuchiCegarLoop]: ======== Iteration 2============ [2019-11-15 20:39:11,208 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 31 states and 44 transitions. [2019-11-15 20:39:11,210 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:11,210 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:11,210 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:11,211 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1] [2019-11-15 20:39:11,211 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:39:11,211 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(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 [2019-11-15 20:39:11,212 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:11,212 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:11,213 INFO L82 PathProgramCache]: Analyzing trace with hash 29860, now seen corresponding path program 1 times [2019-11-15 20:39:11,213 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:11,213 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866142120] [2019-11-15 20:39:11,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,214 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:11,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,282 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:11,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:11,283 INFO L82 PathProgramCache]: Analyzing trace with hash 1244514134, now seen corresponding path program 1 times [2019-11-15 20:39:11,283 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:11,283 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [869550597] [2019-11-15 20:39:11,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,284 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:11,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:11,321 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:11,322 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [869550597] [2019-11-15 20:39:11,322 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 20:39:11,323 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 20:39:11,323 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1367866727] [2019-11-15 20:39:11,326 INFO L808 eck$LassoCheckResult]: loop already infeasible [2019-11-15 20:39:11,326 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 20:39:11,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-15 20:39:11,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-15 20:39:11,331 INFO L87 Difference]: Start difference. First operand 31 states and 44 transitions. cyclomatic complexity: 16 Second operand 4 states. [2019-11-15 20:39:11,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 20:39:11,373 INFO L93 Difference]: Finished difference Result 33 states and 37 transitions. [2019-11-15 20:39:11,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-11-15 20:39:11,374 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 33 states and 37 transitions. [2019-11-15 20:39:11,375 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:39:11,376 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 33 states to 21 states and 25 transitions. [2019-11-15 20:39:11,376 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:39:11,376 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:39:11,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 25 transitions. [2019-11-15 20:39:11,376 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:39:11,377 INFO L688 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 20:39:11,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states and 25 transitions. [2019-11-15 20:39:11,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2019-11-15 20:39:11,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-11-15 20:39:11,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-11-15 20:39:11,379 INFO L711 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 20:39:11,379 INFO L591 BuchiCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-11-15 20:39:11,379 INFO L424 BuchiCegarLoop]: ======== Iteration 3============ [2019-11-15 20:39:11,379 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 21 states and 25 transitions. [2019-11-15 20:39:11,380 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 7 [2019-11-15 20:39:11,380 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:11,381 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:11,381 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:11,381 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:11,381 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 312#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2019-11-15 20:39:11,382 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 315#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 313#L554 [2019-11-15 20:39:11,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:11,382 INFO L82 PathProgramCache]: Analyzing trace with hash 177626382, now seen corresponding path program 1 times [2019-11-15 20:39:11,382 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:11,383 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [533608161] [2019-11-15 20:39:11,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,383 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:11,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,410 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:11,410 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:11,410 INFO L82 PathProgramCache]: Analyzing trace with hash 1175734219, now seen corresponding path program 1 times [2019-11-15 20:39:11,410 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:11,411 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [70470178] [2019-11-15 20:39:11,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,411 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,411 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:11,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,428 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:11,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:11,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1517982238, now seen corresponding path program 1 times [2019-11-15 20:39:11,428 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:11,428 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140764931] [2019-11-15 20:39:11,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,429 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:11,429 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:11,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:11,474 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:11,698 WARN L191 SmtUtils]: Spent 218.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 67 [2019-11-15 20:39:12,240 WARN L191 SmtUtils]: Spent 465.00 ms on a formula simplification. DAG size of input: 119 DAG size of output: 88 [2019-11-15 20:39:12,353 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:12,354 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:12,354 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:12,354 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:12,354 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:12,354 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:12,354 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:12,354 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:12,354 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration3_Lasso [2019-11-15 20:39:12,354 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:12,355 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:12,360 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,366 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,665 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 65 [2019-11-15 20:39:12,780 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 20:39:12,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,793 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,806 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,818 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:12,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:13,738 WARN L191 SmtUtils]: Spent 416.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:39:13,798 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:13,798 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:13,798 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:13,799 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:13,799 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:13,799 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:13,800 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:13,800 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:13,800 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:13,800 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:13,801 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:13,801 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:13,802 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:13,802 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:13,802 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:13,802 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:13,802 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:13,802 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:13,803 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:13,803 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:13,808 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:13,809 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:13,809 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:13,810 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:13,810 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:13,810 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:13,811 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:13,811 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:13,813 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:13,814 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:13,814 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:13,815 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:13,815 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:13,815 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:13,821 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:13,821 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:13,843 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:13,857 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:39:13,858 INFO L444 ModelExtractionUtils]: 2 out of 7 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:39:13,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:13,864 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:13,864 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:13,864 INFO L512 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 [] [2019-11-15 20:39:13,970 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:39:13,973 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:39:14,009 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:14,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:14,027 INFO L256 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:39:14,028 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:14,071 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:14,071 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:39:14,072 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:14,085 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:14,086 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:14,086 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:39:14,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:14,106 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:39:14,107 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:14,122 INFO L375 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 47 treesize of output 20 [2019-11-15 20:39:14,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:14,141 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:14,141 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:14,142 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-11-15 20:39:14,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:14,209 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:14,305 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:14,305 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 [2019-11-15 20:39:14,305 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 21 states and 25 transitions. cyclomatic complexity: 6 Second operand 7 states. [2019-11-15 20:39:14,498 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. [2019-11-15 20:39:14,500 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 [2019-11-15 20:39:14,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:39:14,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 20:39:14,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 7 letters. [2019-11-15 20:39:14,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:14,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 15 letters. Loop has 7 letters. [2019-11-15 20:39:14,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:14,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 8 letters. Loop has 14 letters. [2019-11-15 20:39:14,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:14,504 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 48 states and 58 transitions. [2019-11-15 20:39:14,505 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:14,507 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 48 states to 43 states and 52 transitions. [2019-11-15 20:39:14,507 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 23 [2019-11-15 20:39:14,507 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2019-11-15 20:39:14,507 INFO L73 IsDeterministic]: Start isDeterministic. Operand 43 states and 52 transitions. [2019-11-15 20:39:14,507 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:39:14,507 INFO L688 BuchiCegarLoop]: Abstraction has 43 states and 52 transitions. [2019-11-15 20:39:14,508 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states and 52 transitions. [2019-11-15 20:39:14,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 41. [2019-11-15 20:39:14,513 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2019-11-15 20:39:14,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 49 transitions. [2019-11-15 20:39:14,521 INFO L711 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-15 20:39:14,521 INFO L591 BuchiCegarLoop]: Abstraction has 41 states and 49 transitions. [2019-11-15 20:39:14,521 INFO L424 BuchiCegarLoop]: ======== Iteration 4============ [2019-11-15 20:39:14,521 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 41 states and 49 transitions. [2019-11-15 20:39:14,525 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:14,526 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:14,527 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:14,527 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:14,528 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:39:14,528 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:14,528 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:14,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:14,529 INFO L82 PathProgramCache]: Analyzing trace with hash 1211450581, now seen corresponding path program 1 times [2019-11-15 20:39:14,529 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:14,529 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866343214] [2019-11-15 20:39:14,529 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,530 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,530 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,576 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:14,577 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:14,578 INFO L82 PathProgramCache]: Analyzing trace with hash 1097577162, now seen corresponding path program 2 times [2019-11-15 20:39:14,578 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:14,578 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [891584905] [2019-11-15 20:39:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,579 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,579 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:14,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,601 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:14,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:14,601 INFO L82 PathProgramCache]: Analyzing trace with hash -1001977698, now seen corresponding path program 1 times [2019-11-15 20:39:14,602 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:14,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1294265933] [2019-11-15 20:39:14,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:14,603 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:14,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:14,663 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:14,819 WARN L191 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 59 [2019-11-15 20:39:15,200 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 94 [2019-11-15 20:39:15,361 WARN L191 SmtUtils]: Spent 155.00 ms on a formula simplification that was a NOOP. DAG size: 78 [2019-11-15 20:39:15,365 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:15,365 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:15,365 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:15,365 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:15,366 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:15,366 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:15,366 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:15,366 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:15,366 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration4_Lasso [2019-11-15 20:39:15,366 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:15,366 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:15,370 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,382 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,656 WARN L191 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 67 [2019-11-15 20:39:15,819 WARN L191 SmtUtils]: Spent 158.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 20:39:15,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:15,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:16,426 WARN L191 SmtUtils]: Spent 364.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:39:16,625 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:16,625 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:16,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,627 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,627 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:16,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,628 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,628 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,628 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:16,629 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:16,629 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,631 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,631 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,632 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,633 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,636 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:16,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,636 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,637 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:16,637 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:16,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:16,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:16,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:16,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,665 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:39:16,665 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,666 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,685 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:39:16,686 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,716 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,717 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,718 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,718 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,719 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,719 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,720 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,720 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,721 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,730 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,731 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,732 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,732 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,732 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,733 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,733 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,738 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,739 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,740 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,740 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,740 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,740 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,741 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,741 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,748 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,749 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,749 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,750 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,750 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,750 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,751 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,751 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,755 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,756 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,756 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,757 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,757 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,757 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,759 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,759 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,760 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,761 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,761 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,761 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:16,762 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,762 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,762 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,762 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:16,763 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:16,764 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:16,765 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:16,766 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:16,766 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:16,766 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:16,766 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:16,767 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:16,767 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:16,772 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:16,777 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:39:16,778 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:16,778 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:16,779 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:16,780 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:16,780 INFO L512 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 [] [2019-11-15 20:39:16,883 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:39:16,885 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:39:16,906 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:16,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:16,926 INFO L256 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:16,927 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:16,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:16,942 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:39:16,942 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:16,944 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:16,993 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:16,993 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2019-11-15 20:39:16,994 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 41 states and 49 transitions. cyclomatic complexity: 12 Second operand 4 states. [2019-11-15 20:39:17,042 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. [2019-11-15 20:39:17,042 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 [2019-11-15 20:39:17,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2019-11-15 20:39:17,043 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 18 transitions. [2019-11-15 20:39:17,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 6 letters. [2019-11-15 20:39:17,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:17,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 15 letters. Loop has 6 letters. [2019-11-15 20:39:17,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:17,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 18 transitions. Stem has 9 letters. Loop has 12 letters. [2019-11-15 20:39:17,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:17,045 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 55 states and 66 transitions. [2019-11-15 20:39:17,046 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:17,048 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 55 states to 54 states and 65 transitions. [2019-11-15 20:39:17,048 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 29 [2019-11-15 20:39:17,048 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2019-11-15 20:39:17,048 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 65 transitions. [2019-11-15 20:39:17,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:39:17,049 INFO L688 BuchiCegarLoop]: Abstraction has 54 states and 65 transitions. [2019-11-15 20:39:17,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 65 transitions. [2019-11-15 20:39:17,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 53. [2019-11-15 20:39:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2019-11-15 20:39:17,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 63 transitions. [2019-11-15 20:39:17,063 INFO L711 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-11-15 20:39:17,063 INFO L591 BuchiCegarLoop]: Abstraction has 53 states and 63 transitions. [2019-11-15 20:39:17,064 INFO L424 BuchiCegarLoop]: ======== Iteration 5============ [2019-11-15 20:39:17,064 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 63 transitions. [2019-11-15 20:39:17,066 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 13 [2019-11-15 20:39:17,067 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:17,067 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:17,067 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 2, 1, 1, 1, 1] [2019-11-15 20:39:17,068 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1] [2019-11-15 20:39:17,068 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 848#L552 [2019-11-15 20:39:17,068 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 848#L552 [2019-11-15 20:39:17,068 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:17,069 INFO L82 PathProgramCache]: Analyzing trace with hash 48967168, now seen corresponding path program 2 times [2019-11-15 20:39:17,069 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:17,069 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1694277974] [2019-11-15 20:39:17,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,069 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,070 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:17,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,112 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:17,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:17,113 INFO L82 PathProgramCache]: Analyzing trace with hash 1695896472, now seen corresponding path program 3 times [2019-11-15 20:39:17,113 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:17,114 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227752667] [2019-11-15 20:39:17,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,114 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:17,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,142 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:17,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:17,145 INFO L82 PathProgramCache]: Analyzing trace with hash 1971308119, now seen corresponding path program 1 times [2019-11-15 20:39:17,146 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:17,146 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [604286542] [2019-11-15 20:39:17,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:17,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:17,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:17,195 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:17,403 WARN L191 SmtUtils]: Spent 206.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 61 [2019-11-15 20:39:18,186 WARN L191 SmtUtils]: Spent 722.00 ms on a formula simplification. DAG size of input: 170 DAG size of output: 112 [2019-11-15 20:39:18,285 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:18,285 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:18,285 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:18,285 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:18,285 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:18,285 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:18,285 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:18,286 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:18,286 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration5_Lasso [2019-11-15 20:39:18,286 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:18,286 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:18,288 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,299 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,301 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,304 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,306 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,308 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,315 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,319 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,321 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,322 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,325 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,332 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,334 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,336 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,664 WARN L191 SmtUtils]: Spent 213.00 ms on a formula simplification. DAG size of input: 78 DAG size of output: 69 [2019-11-15 20:39:18,786 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 60 [2019-11-15 20:39:18,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,790 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:18,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:19,504 WARN L191 SmtUtils]: Spent 335.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:39:19,607 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:19,608 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:19,608 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,609 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,609 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,609 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,609 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,609 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,609 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,609 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,611 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,612 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,612 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,612 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,612 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,613 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,613 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,613 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,613 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,613 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,614 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,614 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,615 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,616 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,616 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,616 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,616 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,617 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,617 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,617 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,617 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,617 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,618 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,618 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,618 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,618 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,619 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,623 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,624 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,624 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,624 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,624 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,624 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,625 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,625 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,626 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,627 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,627 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,627 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,628 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,628 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,629 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,629 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,629 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,630 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,630 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,630 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,630 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,631 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,631 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,632 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,632 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,632 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,632 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,633 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,633 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,633 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,634 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,634 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,635 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,635 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,635 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,635 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,636 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,636 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,638 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,639 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,639 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,639 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,639 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,640 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,640 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,640 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,642 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,642 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,642 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,642 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,643 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,643 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,644 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,644 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,645 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,645 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,645 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,645 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,645 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,646 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,646 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,647 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,648 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:19,648 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,649 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:19,649 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,650 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,651 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,651 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,651 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:19,652 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,652 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,652 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,652 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:19,652 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:19,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,654 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,656 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,656 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,659 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,660 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,660 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,660 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,661 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,661 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,676 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,676 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,678 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,679 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,679 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,680 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,680 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,680 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,680 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,681 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,682 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,682 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,683 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,683 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,684 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,687 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,688 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,688 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,688 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,688 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,689 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,689 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,689 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,693 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,694 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,694 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,695 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,695 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,696 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,696 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,700 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,700 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,701 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,701 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,701 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,702 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,702 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,703 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,704 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:19,704 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:19,705 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:19,705 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:19,705 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:19,705 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:19,706 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:19,706 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:19,711 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:19,714 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:39:19,715 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:19,715 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:19,716 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:19,716 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:19,716 INFO L512 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 [] [2019-11-15 20:39:19,832 INFO L297 tatePredicateManager]: 24 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:39:19,833 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:39:19,847 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:19,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:19,867 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:19,868 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:19,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:19,879 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:39:19,880 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:19,885 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 20:39:19,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:19,888 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:19,889 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:19,889 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-15 20:39:19,897 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:19,940 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:19,940 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 [2019-11-15 20:39:19,941 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 20:39:19,996 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. [2019-11-15 20:39:19,998 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 [2019-11-15 20:39:19,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:39:19,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 16 transitions. [2019-11-15 20:39:19,999 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 16 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 20:39:19,999 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:19,999 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:39:20,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:20,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:20,035 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:20,035 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:20,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:20,045 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:39:20,046 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:20,055 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 20:39:20,056 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:20,058 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:20,059 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:20,059 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-15 20:39:20,067 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:20,105 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:20,106 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 [2019-11-15 20:39:20,106 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 20:39:20,160 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. [2019-11-15 20:39:20,162 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 [2019-11-15 20:39:20,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:39:20,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2019-11-15 20:39:20,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 20:39:20,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:20,163 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:39:20,176 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:20,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:20,200 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 2 conjunts are in the unsatisfiable core [2019-11-15 20:39:20,201 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:20,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:20,216 INFO L256 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-15 20:39:20,217 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:20,224 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2019-11-15 20:39:20,225 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:20,228 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:20,228 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:20,228 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:25, output treesize:9 [2019-11-15 20:39:20,235 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:20,268 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:20,268 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 [2019-11-15 20:39:20,268 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 63 transitions. cyclomatic complexity: 15 Second operand 5 states. [2019-11-15 20:39:20,305 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. [2019-11-15 20:39:20,307 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 [2019-11-15 20:39:20,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:39:20,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 21 transitions. [2019-11-15 20:39:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 6 letters. [2019-11-15 20:39:20,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:20,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 20 letters. Loop has 6 letters. [2019-11-15 20:39:20,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:20,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 21 transitions. Stem has 14 letters. Loop has 12 letters. [2019-11-15 20:39:20,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:39:20,311 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 118 states and 142 transitions. [2019-11-15 20:39:20,314 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-15 20:39:20,315 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 118 states to 90 states and 103 transitions. [2019-11-15 20:39:20,315 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 31 [2019-11-15 20:39:20,316 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 39 [2019-11-15 20:39:20,316 INFO L73 IsDeterministic]: Start isDeterministic. Operand 90 states and 103 transitions. [2019-11-15 20:39:20,316 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:39:20,316 INFO L688 BuchiCegarLoop]: Abstraction has 90 states and 103 transitions. [2019-11-15 20:39:20,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states and 103 transitions. [2019-11-15 20:39:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 67. [2019-11-15 20:39:20,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67 states. [2019-11-15 20:39:20,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 80 transitions. [2019-11-15 20:39:20,321 INFO L711 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-11-15 20:39:20,321 INFO L591 BuchiCegarLoop]: Abstraction has 67 states and 80 transitions. [2019-11-15 20:39:20,321 INFO L424 BuchiCegarLoop]: ======== Iteration 6============ [2019-11-15 20:39:20,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 67 states and 80 transitions. [2019-11-15 20:39:20,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 16 [2019-11-15 20:39:20,322 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:39:20,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:39:20,323 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2019-11-15 20:39:20,323 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1] [2019-11-15 20:39:20,324 INFO L791 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.allocOnStack(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.allocOnStack(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.allocOnStack(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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:20,324 INFO L793 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 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 [2019-11-15 20:39:20,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:20,324 INFO L82 PathProgramCache]: Analyzing trace with hash -285922666, now seen corresponding path program 2 times [2019-11-15 20:39:20,324 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:20,325 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [457144415] [2019-11-15 20:39:20,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,325 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:20,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,345 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:20,346 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:20,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1998556810, now seen corresponding path program 1 times [2019-11-15 20:39:20,346 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:20,346 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1772419064] [2019-11-15 20:39:20,346 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,347 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:20,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,361 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:20,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:20,362 INFO L82 PathProgramCache]: Analyzing trace with hash 691396865, now seen corresponding path program 1 times [2019-11-15 20:39:20,362 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:39:20,362 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1839194259] [2019-11-15 20:39:20,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,363 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:39:20,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:39:20,378 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:39:20,395 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:39:20,778 WARN L191 SmtUtils]: Spent 380.00 ms on a formula simplification. DAG size of input: 133 DAG size of output: 93 [2019-11-15 20:39:20,923 WARN L191 SmtUtils]: Spent 127.00 ms on a formula simplification that was a NOOP. DAG size: 72 [2019-11-15 20:39:21,441 WARN L191 SmtUtils]: Spent 516.00 ms on a formula simplification. DAG size of input: 158 DAG size of output: 106 [2019-11-15 20:39:21,555 WARN L191 SmtUtils]: Spent 100.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-11-15 20:39:21,559 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:39:21,559 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:39:21,559 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:39:21,559 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:39:21,559 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:39:21,559 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:39:21,559 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:39:21,559 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:39:21,560 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration6_Lasso [2019-11-15 20:39:21,560 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:39:21,560 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:39:21,563 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,580 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,583 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,585 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,588 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,589 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,592 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,594 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,596 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:21,923 WARN L191 SmtUtils]: Spent 216.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 73 [2019-11-15 20:39:22,082 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification. DAG size of input: 70 DAG size of output: 67 [2019-11-15 20:39:22,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,084 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,088 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,107 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:39:22,678 WARN L191 SmtUtils]: Spent 307.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:39:22,875 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:39:22,876 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:39:22,876 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,877 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,877 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,877 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,877 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,877 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,878 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:22,878 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,880 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,881 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,881 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,882 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,882 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,883 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,883 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,883 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,883 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,884 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,884 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,886 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,886 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,887 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,887 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,888 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:39:22,889 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,889 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:39:22,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,891 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,891 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,892 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,892 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,892 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,893 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,893 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,893 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:22,893 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,894 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,894 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,895 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,895 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,896 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,896 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,896 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,896 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:22,897 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,897 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,898 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,898 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,899 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,899 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,899 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,899 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,900 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:22,900 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,901 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,901 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,902 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,902 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:39:22,902 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,902 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,903 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,903 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:39:22,903 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:39:22,904 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,904 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,905 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,905 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,905 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,906 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,906 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,907 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,908 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,908 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,909 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,909 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:39:22,910 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,910 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,914 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:39:22,914 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,936 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,937 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,937 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,938 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,938 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,938 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,941 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,941 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,957 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,957 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,958 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,958 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,959 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,959 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,960 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,960 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,964 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,965 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,966 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,966 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,966 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,966 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,967 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,968 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,972 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,973 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,973 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,974 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,974 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,974 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,975 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,975 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,979 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:39:22,980 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:39:22,980 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:39:22,981 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:39:22,981 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:39:22,981 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:39:22,982 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:39:22,982 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:39:22,996 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:39:23,003 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:39:23,003 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:39:23,004 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:39:23,004 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:39:23,005 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:39:23,005 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~x~0.base) ULTIMATE.start_main_~x~0.offset)_5 Supporting invariants [] [2019-11-15 20:39:23,119 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:39:23,125 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:39:23,195 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:39:23,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:23,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:39:23,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:23,238 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:23,239 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:39:23,239 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,252 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:23,253 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,253 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:39:23,275 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:39:23,276 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:39:23,278 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:39:23,343 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:23,344 INFO L375 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 89 [2019-11-15 20:39:23,344 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:39:23,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,350 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,352 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,419 INFO L567 ElimStorePlain]: treesize reduction 140, result has 24.3 percent of original size [2019-11-15 20:39:23,420 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,420 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-11-15 20:39:23,462 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,463 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,464 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,465 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,466 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,652 WARN L191 SmtUtils]: Spent 132.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 20:39:23,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:23,861 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-11-15 20:39:23,959 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:39:23,972 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:39:23,973 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:23,974 INFO L375 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 1 case distinctions, treesize of input 40 treesize of output 31 [2019-11-15 20:39:23,975 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,983 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:39:23,983 INFO L375 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 38 treesize of output 22 [2019-11-15 20:39:23,984 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:23,990 INFO L375 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 0 case distinctions, treesize of input 40 treesize of output 31 [2019-11-15 20:39:23,991 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:39:24,017 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:39:24,018 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 20:39:24,018 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:119, output treesize:72 [2019-11-15 20:39:24,099 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:39:24,542 WARN L191 SmtUtils]: Spent 354.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-15 20:39:24,632 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:39:24,632 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-15 20:39:24,632 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2019-11-15 20:40:37,752 WARN L191 SmtUtils]: Spent 169.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-15 20:40:38,004 WARN L191 SmtUtils]: Spent 187.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 20:40:38,166 WARN L191 SmtUtils]: Spent 111.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-11-15 20:41:50,237 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 113 states and 132 transitions. Complement of second has 22 states. [2019-11-15 20:41:50,241 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 20:41:50,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 20:41:50,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 22 transitions. [2019-11-15 20:41:50,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 22 transitions. Stem has 12 letters. Loop has 13 letters. [2019-11-15 20:41:50,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:41:50,242 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:41:50,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:41:50,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:50,279 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:41:50,280 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:41:50,289 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:41:50,289 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:41:50,289 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,295 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:41:50,295 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,296 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:41:50,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:41:50,309 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:41:50,309 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:41:50,345 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:41:50,345 INFO L375 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 89 [2019-11-15 20:41:50,345 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:41:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,346 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,347 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,348 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,349 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,350 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,458 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 30 [2019-11-15 20:41:50,458 INFO L567 ElimStorePlain]: treesize reduction 225, result has 17.0 percent of original size [2019-11-15 20:41:50,459 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,459 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-11-15 20:41:50,490 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,491 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,492 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,652 WARN L191 SmtUtils]: Spent 136.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 20:41:50,653 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:50,788 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-11-15 20:41:50,861 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:41:50,878 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:41:50,887 INFO L375 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 38 treesize of output 22 [2019-11-15 20:41:50,888 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,897 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:41:50,898 INFO L375 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 40 treesize of output 31 [2019-11-15 20:41:50,898 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,908 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:41:50,908 INFO L375 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 1 case distinctions, treesize of input 40 treesize of output 31 [2019-11-15 20:41:50,909 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:41:50,929 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:41:50,930 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 20:41:50,930 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:119, output treesize:72 [2019-11-15 20:41:50,985 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:41:51,214 WARN L191 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-15 20:41:51,285 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:41:51,286 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 8 loop predicates [2019-11-15 20:41:51,286 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2019-11-15 20:43:04,057 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 45 [2019-11-15 20:43:04,280 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 52 DAG size of output: 49 [2019-11-15 20:44:16,474 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 109 states and 127 transitions. Complement of second has 22 states. [2019-11-15 20:44:16,477 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 20:44:16,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 20:44:16,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 21 transitions. [2019-11-15 20:44:16,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 21 transitions. Stem has 12 letters. Loop has 13 letters. [2019-11-15 20:44:16,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:44:16,478 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:44:16,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:44:16,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:16,513 INFO L256 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:44:16,514 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:16,521 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,521 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:44:16,522 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,527 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,527 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,527 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:44:16,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:44:16,542 INFO L256 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:44:16,542 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:44:16,577 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:16,578 INFO L375 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 2 new quantified variables, introduced 4 case distinctions, treesize of input 47 treesize of output 89 [2019-11-15 20:44:16,578 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:44:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,579 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,580 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,581 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,582 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,667 INFO L567 ElimStorePlain]: treesize reduction 210, result has 17.6 percent of original size [2019-11-15 20:44:16,668 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:44:16,668 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:38 [2019-11-15 20:44:16,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,700 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,701 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,828 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 40 DAG size of output: 39 [2019-11-15 20:44:16,828 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:16,957 WARN L191 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 39 [2019-11-15 20:44:17,023 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 3 terms [2019-11-15 20:44:17,058 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:17,059 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:17,060 INFO L375 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 1 case distinctions, treesize of input 40 treesize of output 31 [2019-11-15 20:44:17,060 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:17,067 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:44:17,068 INFO L375 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 40 treesize of output 31 [2019-11-15 20:44:17,069 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:17,072 INFO L375 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 38 treesize of output 22 [2019-11-15 20:44:17,073 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:44:17,093 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:44:17,094 INFO L496 ElimStorePlain]: Start of recursive call 1: 4 dim-0 vars, 1 dim-2 vars, End of recursive call: 4 dim-0 vars, and 3 xjuncts. [2019-11-15 20:44:17,094 INFO L221 ElimStorePlain]: Needed 4 recursive calls to eliminate 5 variables, input treesize:119, output treesize:72 [2019-11-15 20:44:17,150 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:44:17,375 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 45 [2019-11-15 20:44:17,471 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:44:17,471 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 8 loop predicates [2019-11-15 20:44:17,471 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18 Second operand 11 states. [2019-11-15 20:45:06,685 WARN L191 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-15 20:45:06,918 WARN L191 SmtUtils]: Spent 183.00 ms on a formula simplification. DAG size of input: 72 DAG size of output: 67 [2019-11-15 20:45:07,073 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 73 DAG size of output: 48 [2019-11-15 20:45:55,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 67 states and 80 transitions. cyclomatic complexity: 18. Second operand 11 states. Result 159 states and 187 transitions. Complement of second has 25 states. [2019-11-15 20:45:55,131 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 12 states 2 stem states 9 non-accepting loop states 1 accepting loop states [2019-11-15 20:45:55,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2019-11-15 20:45:55,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 29 transitions. [2019-11-15 20:45:55,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 12 letters. Loop has 13 letters. [2019-11-15 20:45:55,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 25 letters. Loop has 13 letters. [2019-11-15 20:45:55,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:55,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 12 states and 29 transitions. Stem has 12 letters. Loop has 26 letters. [2019-11-15 20:45:55,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:55,134 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 159 states and 187 transitions. [2019-11-15 20:45:55,136 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 36 [2019-11-15 20:45:55,138 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 159 states to 119 states and 141 transitions. [2019-11-15 20:45:55,138 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 33 [2019-11-15 20:45:55,138 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 40 [2019-11-15 20:45:55,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 119 states and 141 transitions. [2019-11-15 20:45:55,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:45:55,138 INFO L688 BuchiCegarLoop]: Abstraction has 119 states and 141 transitions. [2019-11-15 20:45:55,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states and 141 transitions. [2019-11-15 20:45:55,144 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 92. [2019-11-15 20:45:55,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2019-11-15 20:45:55,145 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 112 transitions. [2019-11-15 20:45:55,145 INFO L711 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-11-15 20:45:55,146 INFO L591 BuchiCegarLoop]: Abstraction has 92 states and 112 transitions. [2019-11-15 20:45:55,146 INFO L424 BuchiCegarLoop]: ======== Iteration 7============ [2019-11-15 20:45:55,146 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 112 transitions. [2019-11-15 20:45:55,147 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 27 [2019-11-15 20:45:55,147 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:45:55,147 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:45:55,147 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 20:45:55,148 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:55,148 INFO L791 eck$LassoCheckResult]: Stem: 2393#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2388#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.allocOnStack(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.allocOnStack(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.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 2389#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2424#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; 2422#L551-3 main_#t~short9 := main_#t~short7; 2423#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; 2409#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 2398#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2399#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; 2406#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2431#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; 2469#L551-3 main_#t~short9 := main_#t~short7; 2466#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; 2390#L551-6 [2019-11-15 20:45:55,148 INFO L793 eck$LassoCheckResult]: Loop: 2390#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 2402#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 2410#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; 2394#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 2395#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; 2384#L551-3 main_#t~short9 := main_#t~short7; 2385#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; 2390#L551-6 [2019-11-15 20:45:55,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,148 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 3 times [2019-11-15 20:45:55,148 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,149 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223732745] [2019-11-15 20:45:55,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,149 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,149 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,166 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:55,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,167 INFO L82 PathProgramCache]: Analyzing trace with hash -949832095, now seen corresponding path program 2 times [2019-11-15 20:45:55,167 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,167 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085998259] [2019-11-15 20:45:55,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,167 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,168 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,175 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:55,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:55,175 INFO L82 PathProgramCache]: Analyzing trace with hash -1984317209, now seen corresponding path program 1 times [2019-11-15 20:45:55,176 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:55,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1487903773] [2019-11-15 20:45:55,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:55,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:55,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:55,200 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:55,402 WARN L191 SmtUtils]: Spent 200.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 73 [2019-11-15 20:45:55,556 WARN L191 SmtUtils]: Spent 151.00 ms on a formula simplification that was a NOOP. DAG size: 70 [2019-11-15 20:45:56,043 WARN L191 SmtUtils]: Spent 486.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 120 [2019-11-15 20:45:56,869 WARN L191 SmtUtils]: Spent 790.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2019-11-15 20:45:56,874 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:45:56,874 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:45:56,874 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:45:56,874 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:45:56,874 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:45:56,874 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:45:56,874 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:45:56,874 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:45:56,874 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration7_Lasso [2019-11-15 20:45:56,875 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:45:56,875 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:45:56,880 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:56,891 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,586 WARN L191 SmtUtils]: Spent 576.00 ms on a formula simplification. DAG size of input: 92 DAG size of output: 80 [2019-11-15 20:45:57,774 WARN L191 SmtUtils]: Spent 184.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-15 20:45:57,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,794 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:57,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:45:58,484 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:45:58,588 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:45:58,588 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:45:58,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,589 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,589 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,589 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,589 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,589 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,589 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,590 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,591 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,591 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,591 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,591 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,591 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,592 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,592 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,595 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,595 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,596 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,596 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,596 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,599 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,601 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,601 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,601 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,602 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,602 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,603 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,603 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,603 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,603 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,604 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,604 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,604 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,607 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,607 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,607 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,608 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:45:58,608 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:45:58,608 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,611 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:45:58,611 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:45:58,624 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:45:58,624 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:45:58,625 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:45:58,625 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:45:58,625 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:45:58,625 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:45:58,626 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:45:58,626 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:45:58,632 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:45:58,634 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2019-11-15 20:45:58,635 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 1 variables to zero. [2019-11-15 20:45:58,635 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:45:58,635 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:45:58,636 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:45:58,636 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6) = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~y~0.base) ULTIMATE.start_main_~y~0.offset)_6 Supporting invariants [] [2019-11-15 20:45:58,753 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:45:58,755 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:45:58,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:58,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,800 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:45:58,804 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:58,822 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:58,822 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:45:58,823 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:58,830 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:58,830 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:58,830 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:45:58,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:58,848 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:58,849 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:58,855 INFO L375 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 47 treesize of output 20 [2019-11-15 20:45:58,855 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:58,863 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:58,863 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:58,864 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-11-15 20:45:58,877 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:58,907 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:58,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:58,938 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 [2019-11-15 20:45:58,938 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-11-15 20:45:59,052 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 181 states and 222 transitions. Complement of second has 12 states. [2019-11-15 20:45:59,053 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 [2019-11-15 20:45:59,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:45:59,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-11-15 20:45:59,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-15 20:45:59,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:59,054 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:45:59,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:59,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:59,089 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:45:59,090 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:59,099 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,100 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:45:59,100 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,106 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,106 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,107 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:45:59,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:59,118 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:59,119 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:59,124 INFO L375 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 47 treesize of output 20 [2019-11-15 20:45:59,124 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,131 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,131 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,132 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-11-15 20:45:59,143 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:59,165 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:59,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:59,189 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:45:59,189 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-11-15 20:45:59,287 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 181 states and 222 transitions. Complement of second has 12 states. [2019-11-15 20:45:59,290 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 [2019-11-15 20:45:59,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:45:59,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 19 transitions. [2019-11-15 20:45:59,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-15 20:45:59,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:59,291 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:45:59,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:59,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:59,324 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:45:59,325 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:59,346 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,346 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:45:59,347 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,357 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,357 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,357 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:45:59,366 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:45:59,366 INFO L256 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:45:59,367 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:45:59,370 INFO L375 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 47 treesize of output 20 [2019-11-15 20:45:59,371 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,376 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:45:59,376 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:45:59,376 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:51, output treesize:14 [2019-11-15 20:45:59,391 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:59,419 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:45:59,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:45:59,443 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 4 loop predicates [2019-11-15 20:45:59,443 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26 Second operand 7 states. [2019-11-15 20:45:59,569 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 92 states and 112 transitions. cyclomatic complexity: 26. Second operand 7 states. Result 237 states and 291 transitions. Complement of second has 13 states. [2019-11-15 20:45:59,571 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 [2019-11-15 20:45:59,571 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2019-11-15 20:45:59,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 25 transitions. [2019-11-15 20:45:59,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-15 20:45:59,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:59,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 20:45:59,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:59,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 25 transitions. Stem has 13 letters. Loop has 14 letters. [2019-11-15 20:45:59,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:45:59,573 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 237 states and 291 transitions. [2019-11-15 20:45:59,575 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 41 [2019-11-15 20:45:59,577 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 237 states to 182 states and 218 transitions. [2019-11-15 20:45:59,577 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2019-11-15 20:45:59,577 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 36 [2019-11-15 20:45:59,577 INFO L73 IsDeterministic]: Start isDeterministic. Operand 182 states and 218 transitions. [2019-11-15 20:45:59,577 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:45:59,577 INFO L688 BuchiCegarLoop]: Abstraction has 182 states and 218 transitions. [2019-11-15 20:45:59,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states and 218 transitions. [2019-11-15 20:45:59,591 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 143. [2019-11-15 20:45:59,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 143 states. [2019-11-15 20:45:59,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 174 transitions. [2019-11-15 20:45:59,597 INFO L711 BuchiCegarLoop]: Abstraction has 143 states and 174 transitions. [2019-11-15 20:45:59,597 INFO L591 BuchiCegarLoop]: Abstraction has 143 states and 174 transitions. [2019-11-15 20:45:59,597 INFO L424 BuchiCegarLoop]: ======== Iteration 8============ [2019-11-15 20:45:59,597 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 143 states and 174 transitions. [2019-11-15 20:45:59,599 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2019-11-15 20:45:59,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:45:59,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:45:59,600 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [2, 2, 2, 2, 1, 1, 1, 1, 1] [2019-11-15 20:45:59,600 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:45:59,601 INFO L791 eck$LassoCheckResult]: Stem: 3446#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 3441#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.allocOnStack(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.allocOnStack(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.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 3442#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3451#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; 3543#L551-3 main_#t~short9 := main_#t~short7; 3573#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; 3572#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 3447#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3448#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; 3460#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3500#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; 3494#L551-3 main_#t~short9 := main_#t~short7; 3490#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; 3476#L551-6 [2019-11-15 20:45:59,601 INFO L793 eck$LassoCheckResult]: Loop: 3476#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 3481#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 3480#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; 3479#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 3478#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; 3477#L551-3 main_#t~short9 := main_#t~short7; 3475#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; 3476#L551-6 [2019-11-15 20:45:59,601 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:59,601 INFO L82 PathProgramCache]: Analyzing trace with hash -273668037, now seen corresponding path program 4 times [2019-11-15 20:45:59,601 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:59,602 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [921516417] [2019-11-15 20:45:59,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,602 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,602 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:59,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,633 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:59,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:59,634 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 1 times [2019-11-15 20:45:59,634 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:59,634 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846851484] [2019-11-15 20:45:59,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,634 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,634 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:59,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,643 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:59,643 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:45:59,643 INFO L82 PathProgramCache]: Analyzing trace with hash -1982470167, now seen corresponding path program 5 times [2019-11-15 20:45:59,643 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:45:59,644 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1842640061] [2019-11-15 20:45:59,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,644 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:45:59,644 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:45:59,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:45:59,686 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:45:59,902 WARN L191 SmtUtils]: Spent 215.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-15 20:46:00,085 WARN L191 SmtUtils]: Spent 180.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 20:46:00,601 WARN L191 SmtUtils]: Spent 515.00 ms on a formula simplification. DAG size of input: 169 DAG size of output: 120 [2019-11-15 20:46:01,324 WARN L191 SmtUtils]: Spent 690.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 99 [2019-11-15 20:46:01,327 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:46:01,327 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:46:01,327 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:46:01,327 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:46:01,327 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:46:01,327 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:01,327 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:46:01,327 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:46:01,327 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration8_Lasso [2019-11-15 20:46:01,327 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:46:01,328 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:46:01,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:01,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:01,344 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:01,355 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:01,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:01,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,041 WARN L191 SmtUtils]: Spent 590.00 ms on a formula simplification. DAG size of input: 94 DAG size of output: 82 [2019-11-15 20:46:02,183 WARN L191 SmtUtils]: Spent 137.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-15 20:46:02,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,195 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,199 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:02,878 WARN L191 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:46:03,067 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:46:03,067 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:46:03,067 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,068 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,068 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,068 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,069 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,069 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,070 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,070 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,070 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,070 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,070 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,071 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,072 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,072 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,072 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,073 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,073 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,073 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,074 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,074 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,074 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,074 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,074 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,074 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,075 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,075 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,075 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,075 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,076 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,076 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,076 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,076 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,076 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,076 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,083 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,086 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,086 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,087 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,087 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,089 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,093 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,102 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,102 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:03,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,103 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,105 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:46:03,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,118 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,118 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,118 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,119 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,119 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,119 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,120 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,123 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,124 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,124 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,124 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,127 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,127 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,127 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,128 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,128 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,128 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,128 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,129 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,131 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,131 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,132 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,132 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:03,132 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:03,132 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,134 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:46:03,135 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,161 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,162 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,162 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,163 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,163 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,163 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,163 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,164 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,164 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,165 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,165 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,165 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,165 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,166 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,166 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,166 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,166 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,166 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,167 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,167 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,167 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,168 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,168 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,168 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,168 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,168 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,169 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,169 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,169 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,169 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,170 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,170 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,170 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,170 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,171 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,171 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,172 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,172 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,172 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,172 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,172 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,173 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,173 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,173 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,174 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,174 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,174 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,174 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,175 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,175 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,176 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,177 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,177 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,177 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,177 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,178 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,178 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,178 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,178 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,178 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,179 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,179 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,179 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,179 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,180 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,180 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,180 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:03,180 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,180 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,181 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,181 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,181 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,181 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,181 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:03,182 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:03,182 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:03,183 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,183 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 20:46:03,184 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,184 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,184 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,185 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,185 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,185 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,185 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,186 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,187 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,187 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,187 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,187 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,188 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,188 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,188 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,190 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,190 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,191 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,191 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,191 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,191 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,192 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,192 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,193 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,193 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,194 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,194 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,194 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,194 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,194 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,195 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,195 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,195 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,195 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,196 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,196 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,196 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,196 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,196 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,197 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,197 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,197 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,198 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,198 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,198 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,198 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,199 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,200 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,204 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,205 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,205 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,205 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,206 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,206 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,206 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,207 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,208 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,208 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,208 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,208 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,209 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,209 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,209 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,210 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,213 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,213 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,214 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,214 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,214 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,215 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,217 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,217 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,230 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,230 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,231 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,231 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:03,231 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,232 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,234 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:03,235 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,254 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,254 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,255 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,255 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,255 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,255 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,256 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,256 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,260 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,261 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,261 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,261 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,262 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,262 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,263 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,266 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,266 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,267 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,267 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,267 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,267 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,268 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,268 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,272 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,272 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,272 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,273 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:03,273 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:03,273 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,276 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:03,276 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 20:46:03,344 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,344 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,345 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,345 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,345 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,345 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,346 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,346 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,347 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,347 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,347 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,347 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,347 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,348 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,348 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,348 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,348 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,349 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,349 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,349 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,349 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,349 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,350 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,350 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,350 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,350 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,351 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,351 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,351 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,351 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,352 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,352 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,352 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,352 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,353 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,353 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,354 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,354 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,354 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,354 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,354 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,355 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,355 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,355 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,355 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,356 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,356 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,356 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,356 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,357 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,357 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,359 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,359 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,360 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,360 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,360 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,360 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,360 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,360 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,360 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,361 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,361 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,361 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,362 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,362 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,362 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,362 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,362 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,362 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,363 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,363 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,363 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,364 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,364 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,364 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,364 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,365 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,366 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 20:46:03,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,367 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,367 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,367 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,368 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,368 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,369 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,370 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,370 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,370 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,370 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,371 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,371 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,371 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,373 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,374 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,374 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,374 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,374 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,375 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,375 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,376 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,377 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,377 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,377 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,377 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,378 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,378 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,378 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,378 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,379 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,379 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,379 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,379 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,380 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,380 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,380 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,380 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,380 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,381 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,381 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,381 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,382 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,382 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,382 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,383 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,383 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,389 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,390 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,390 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,390 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,391 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,391 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,391 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,392 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,394 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,395 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,395 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,399 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,400 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,400 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,400 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,400 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,401 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,403 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,403 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,418 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,419 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,419 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,420 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:03,420 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,420 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,424 INFO L400 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-11-15 20:46:03,424 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,448 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,449 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,449 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,450 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,451 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,451 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,457 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,457 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,458 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,458 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,462 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,463 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,463 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,463 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,463 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,464 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,464 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,465 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,469 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,469 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,470 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,470 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:03,470 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:03,470 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,474 INFO L400 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-11-15 20:46:03,474 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-15 20:46:03,557 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,557 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,558 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,558 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,558 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,558 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,559 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,559 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,560 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,561 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,561 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,561 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,562 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,562 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,562 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,562 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,562 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,563 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,563 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,564 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,564 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,564 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,564 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,564 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,565 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,565 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,565 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,566 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,566 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,566 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,566 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,566 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,567 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,567 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,569 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,569 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,569 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,570 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,570 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,570 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,570 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,570 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,570 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,571 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,571 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,572 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,572 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,572 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,572 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,573 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,573 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,575 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,576 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,576 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,576 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,577 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,577 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,577 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,577 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,577 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,578 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,578 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,578 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,579 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,579 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,579 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,579 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,579 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:03,579 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,580 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,580 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,581 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,581 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,581 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,581 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:03,582 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:03,582 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:03,584 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,584 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 20:46:03,584 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,585 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,585 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,585 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,585 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,586 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,586 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,587 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,588 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,588 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,588 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,588 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,588 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,589 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,589 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,592 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,592 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,592 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,593 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,593 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,593 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,594 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,594 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,595 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,596 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,596 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,596 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,596 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,596 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,597 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,597 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,597 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,598 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,598 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,598 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,598 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,599 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,599 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,599 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,599 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,599 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,600 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,600 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,600 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,601 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,601 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,601 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,602 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,602 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,610 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,611 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,611 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,611 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,611 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,612 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,612 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,612 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,614 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,614 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,615 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,615 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,615 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,615 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,616 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,616 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,623 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,623 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,623 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,627 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,627 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,646 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,646 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,647 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,647 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:03,647 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,647 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,652 INFO L400 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-11-15 20:46:03,652 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,684 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,684 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,686 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,686 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,692 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,693 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,693 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,694 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,694 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,694 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,695 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,695 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,701 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,701 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,702 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,702 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,702 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,702 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,703 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,703 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,709 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,709 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,709 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,710 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:03,710 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:03,710 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,715 INFO L400 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-11-15 20:46:03,715 INFO L401 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2019-11-15 20:46:03,835 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,836 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,837 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,837 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,837 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,840 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,840 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,840 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,841 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,841 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,841 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,842 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,842 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,842 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,842 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,843 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,843 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,843 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,844 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,844 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,844 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,845 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,845 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,845 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,846 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,846 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,847 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,848 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,848 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,848 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,848 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,849 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,849 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,849 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,849 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,850 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,854 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,855 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,855 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,855 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,855 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,856 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,856 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,860 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,861 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,861 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,861 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,862 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,862 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,862 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,862 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,862 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,863 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,863 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,864 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,864 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,864 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,864 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,864 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:03,865 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,865 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,866 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:03,866 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,866 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,866 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:03,867 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:03,867 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:03,870 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,870 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 20:46:03,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,871 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,871 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,872 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,872 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,872 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,874 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,875 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,875 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,876 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,876 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,876 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,876 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,877 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,879 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,879 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,880 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,880 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,880 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,880 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,880 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,881 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,882 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,884 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,885 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,885 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,885 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,885 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,886 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,886 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,886 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,886 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,886 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,888 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,888 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,888 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:03,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,889 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,889 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:03,889 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:03,890 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,890 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,890 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,891 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,891 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,891 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,891 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,892 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,892 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,905 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,906 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,906 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,906 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,907 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,907 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,907 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,908 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,908 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,910 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,910 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,910 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,910 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,911 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,911 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,911 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,912 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,912 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,917 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,917 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,917 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,918 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,918 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,918 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,918 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,921 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,921 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,945 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,946 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,947 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,947 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,947 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:03,947 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,947 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,951 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:03,951 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,971 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,972 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,972 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,973 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,973 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,973 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,973 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,974 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,974 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,987 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:03,988 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:03,989 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:03,989 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:03,989 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:03,989 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:03,990 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:03,991 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:03,991 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:03,999 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:04,001 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:04,002 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:04,002 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:04,002 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:04,002 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:04,002 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:04,003 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:04,003 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:04,008 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:04,008 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:04,008 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:04,009 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:04,009 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:04,009 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:04,009 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:04,013 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:04,013 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 20:46:04,286 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:46:04,346 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:46:04,347 INFO L444 ModelExtractionUtils]: 21 out of 34 variables were initially zero. Simplification set additionally 3 variables to zero. [2019-11-15 20:46:04,347 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:46:04,349 INFO L438 nArgumentSynthesizer]: Removed 5 redundant supporting invariants from a total of 6. [2019-11-15 20:46:04,349 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:46:04,350 INFO L512 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)_7 Supporting invariants [-1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_7 + 1*ULTIMATE.start_main_#t~mem8 >= 0] [2019-11-15 20:46:04,487 INFO L297 tatePredicateManager]: 23 out of 25 supporting invariants were superfluous and have been removed [2019-11-15 20:46:04,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:04,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 11 conjunts are in the unsatisfiable core [2019-11-15 20:46:04,557 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:04,570 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:04,570 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:46:04,571 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:04,577 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:04,578 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:04,578 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:46:04,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:04,607 INFO L256 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:46:04,608 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:04,609 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:04,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:04,610 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:04,642 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:04,650 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:04,657 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:04,657 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:04,668 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:04,668 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:04,701 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:04,701 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:46:04,701 INFO L221 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:115, output treesize:41 [2019-11-15 20:46:04,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:04,754 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 [2019-11-15 20:46:04,754 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 143 states and 174 transitions. cyclomatic complexity: 40 Second operand 5 states. [2019-11-15 20:46:04,971 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 143 states and 174 transitions. cyclomatic complexity: 40. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 10 states. [2019-11-15 20:46:04,971 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 [2019-11-15 20:46:04,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:46:04,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 19 transitions. [2019-11-15 20:46:04,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 7 letters. [2019-11-15 20:46:04,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:04,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 20:46:04,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:04,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 19 transitions. Stem has 13 letters. Loop has 14 letters. [2019-11-15 20:46:04,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:04,973 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 312 states and 370 transitions. [2019-11-15 20:46:04,975 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2019-11-15 20:46:04,977 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 312 states to 221 states and 265 transitions. [2019-11-15 20:46:04,977 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 32 [2019-11-15 20:46:04,977 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 32 [2019-11-15 20:46:04,977 INFO L73 IsDeterministic]: Start isDeterministic. Operand 221 states and 265 transitions. [2019-11-15 20:46:04,977 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:46:04,977 INFO L688 BuchiCegarLoop]: Abstraction has 221 states and 265 transitions. [2019-11-15 20:46:04,978 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 221 states and 265 transitions. [2019-11-15 20:46:04,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 221 to 179. [2019-11-15 20:46:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 179 states. [2019-11-15 20:46:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 218 transitions. [2019-11-15 20:46:04,996 INFO L711 BuchiCegarLoop]: Abstraction has 179 states and 218 transitions. [2019-11-15 20:46:04,997 INFO L591 BuchiCegarLoop]: Abstraction has 179 states and 218 transitions. [2019-11-15 20:46:04,997 INFO L424 BuchiCegarLoop]: ======== Iteration 9============ [2019-11-15 20:46:04,997 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 179 states and 218 transitions. [2019-11-15 20:46:04,998 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 40 [2019-11-15 20:46:04,998 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:04,998 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:04,999 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1] [2019-11-15 20:46:04,999 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2019-11-15 20:46:04,999 INFO L791 eck$LassoCheckResult]: Stem: 4097#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 4091#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.allocOnStack(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.allocOnStack(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.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 4092#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4141#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; 4140#L551-3 main_#t~short9 := main_#t~short7; 4138#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; 4110#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 4111#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4161#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; 4130#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4131#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; 4126#L551-3 main_#t~short9 := main_#t~short7; 4127#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; 4123#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 4122#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4117#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; 4118#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4136#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; 4137#L551-3 main_#t~short9 := main_#t~short7; 4134#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; 4135#L551-6 [2019-11-15 20:46:05,000 INFO L793 eck$LassoCheckResult]: Loop: 4135#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 4106#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 4107#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; 4102#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 4103#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; 4093#L551-3 main_#t~short9 := main_#t~short7; 4094#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; 4135#L551-6 [2019-11-15 20:46:05,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:05,000 INFO L82 PathProgramCache]: Analyzing trace with hash 2054331691, now seen corresponding path program 2 times [2019-11-15 20:46:05,000 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:05,000 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1226527867] [2019-11-15 20:46:05,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,001 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:05,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,028 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:05,028 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:05,029 INFO L82 PathProgramCache]: Analyzing trace with hash -947985053, now seen corresponding path program 2 times [2019-11-15 20:46:05,029 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:05,029 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697524390] [2019-11-15 20:46:05,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,029 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,029 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:05,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,036 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,037 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:05,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:05,039 INFO L82 PathProgramCache]: Analyzing trace with hash 742589689, now seen corresponding path program 3 times [2019-11-15 20:46:05,039 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:05,039 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [171355717] [2019-11-15 20:46:05,039 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,040 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:05,040 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:05,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:05,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:05,251 WARN L191 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 72 [2019-11-15 20:46:05,397 WARN L191 SmtUtils]: Spent 143.00 ms on a formula simplification that was a NOOP. DAG size: 69 [2019-11-15 20:46:06,494 WARN L191 SmtUtils]: Spent 1.10 s on a formula simplification. DAG size of input: 221 DAG size of output: 157 [2019-11-15 20:46:07,620 WARN L191 SmtUtils]: Spent 1.11 s on a formula simplification. DAG size of input: 115 DAG size of output: 115 [2019-11-15 20:46:07,623 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:46:07,623 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:46:07,623 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:46:07,623 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:46:07,623 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:46:07,624 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:07,624 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:46:07,624 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:46:07,624 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration9_Lasso [2019-11-15 20:46:07,624 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:46:07,624 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:46:07,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,636 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,671 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:07,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:08,505 WARN L191 SmtUtils]: Spent 652.00 ms on a formula simplification. DAG size of input: 97 DAG size of output: 83 [2019-11-15 20:46:08,678 WARN L191 SmtUtils]: Spent 166.00 ms on a formula simplification. DAG size of input: 76 DAG size of output: 72 [2019-11-15 20:46:08,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:09,326 WARN L191 SmtUtils]: Spent 301.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:46:09,522 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:46:09,522 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:46:09,522 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,523 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,523 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,523 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,523 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,523 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,523 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,524 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,525 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,525 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,525 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,525 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,525 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,525 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,526 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,526 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,526 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,527 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,527 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,527 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,527 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,527 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,528 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,528 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,529 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,529 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,529 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,529 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,529 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,529 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,530 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,530 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,530 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,530 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,531 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,531 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,531 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,531 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,531 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,531 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,531 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,532 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,532 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,532 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,532 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,532 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,532 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,532 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,533 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,533 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,533 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,533 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,533 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,533 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,534 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,534 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,534 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,535 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,535 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,535 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,535 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,535 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,536 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,536 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,537 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,538 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,538 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,538 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,538 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,539 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,539 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,539 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,539 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,539 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,540 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,540 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,540 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,540 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,541 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,541 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,541 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,541 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,542 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,542 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,542 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,542 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,542 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,543 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,543 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,544 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,544 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,544 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,544 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,545 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,545 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,545 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,545 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,545 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,546 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,546 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,546 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,546 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,546 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,547 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,547 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,547 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,547 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,547 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,548 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,548 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,548 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,548 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,548 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,549 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,549 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:09,549 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,549 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,550 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,550 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,550 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,550 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,550 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,551 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,551 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,553 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,554 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,554 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,554 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,554 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,554 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,555 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,555 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,558 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,559 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,559 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,559 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:09,559 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,560 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,562 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:46:09,562 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,573 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,574 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,574 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,574 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:09,575 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:09,575 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,577 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:46:09,577 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,605 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,605 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,606 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,606 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,606 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,606 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,607 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,607 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,609 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,610 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,610 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,610 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,610 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,610 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,612 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,612 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,619 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,619 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,620 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,620 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,620 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,620 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,621 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,621 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,622 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,622 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,622 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,622 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,623 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,623 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,623 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,623 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,626 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,626 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,626 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,626 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,627 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,627 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,627 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,627 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,630 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,630 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,630 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,630 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,631 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,631 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:09,631 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:09,631 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:09,632 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,632 INFO L489 LassoAnalysis]: Using template '2-nested'. [2019-11-15 20:46:09,633 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,633 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,633 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,633 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,634 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,634 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,634 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,635 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,635 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,636 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,636 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,636 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,636 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,637 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,637 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,637 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,638 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,638 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,638 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,638 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,639 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,639 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,639 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,641 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,641 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,641 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,641 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,642 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,642 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,642 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,642 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,643 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,643 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,644 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,644 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,644 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,644 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,644 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,645 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,645 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,645 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,646 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,646 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,646 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,646 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,646 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,647 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,647 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,647 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,647 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,648 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,648 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,648 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,648 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,649 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,649 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,649 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,650 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,650 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,650 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,650 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,650 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,651 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,651 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,653 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,653 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,654 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,654 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,654 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,654 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,654 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,655 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,655 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,655 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,656 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,657 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,657 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,657 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,657 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,657 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,658 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,658 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,658 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,669 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,669 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,671 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,672 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,672 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,672 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,672 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,673 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,674 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,678 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,679 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,679 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,679 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,679 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,680 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,680 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,680 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,681 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,681 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,681 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,682 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,682 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,682 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,682 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,682 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,683 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,683 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,683 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,684 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,684 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,684 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,684 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,684 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:09,684 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,685 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,685 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,686 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,686 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,686 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,686 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,687 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,687 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,691 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,691 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,692 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,692 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,692 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,692 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,693 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,693 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,698 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,699 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,700 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,700 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:09,700 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,700 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,703 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:09,704 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,722 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,726 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,726 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,726 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:09,726 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:09,727 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,730 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:09,730 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 20:46:09,796 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,796 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,797 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,797 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,797 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,797 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,798 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,798 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,802 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,802 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,803 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,803 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,803 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,803 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,805 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,805 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,816 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,816 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,817 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,817 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,817 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,817 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,818 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,818 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,819 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,819 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,819 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,819 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,820 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,820 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,820 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,821 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,824 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,824 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,824 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,825 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,825 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,825 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,826 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,826 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,829 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,829 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,830 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,830 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,830 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,830 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:09,831 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:09,831 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:09,832 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,833 INFO L489 LassoAnalysis]: Using template '3-nested'. [2019-11-15 20:46:09,833 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,833 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,833 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,834 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,834 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,834 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,834 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,836 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,836 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,836 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,837 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,837 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,837 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,837 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,838 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,839 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,839 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,839 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,840 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,840 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,840 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,840 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,841 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,842 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,843 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,843 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,843 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,843 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,843 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,844 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,844 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,845 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,846 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,846 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,847 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,847 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,847 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,847 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,847 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,847 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,848 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,851 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,852 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,852 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,852 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,852 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,852 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,852 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,853 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,853 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,854 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,854 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,854 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,854 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,855 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,855 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,857 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,857 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,857 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,858 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,858 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,858 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,859 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,859 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,862 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,862 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,862 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,862 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,863 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,863 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,863 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,863 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,863 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,864 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,864 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,864 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,865 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,865 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,865 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,865 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,865 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,866 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,866 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,866 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,867 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,867 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,867 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,867 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,868 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,868 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,869 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,870 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,870 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,870 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,871 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,871 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,871 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,871 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,871 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,872 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,872 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,873 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,873 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,873 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,873 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,873 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,874 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,874 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,874 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,875 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,879 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,879 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:09,879 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,879 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,879 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,880 INFO L400 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2019-11-15 20:46:09,880 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:09,880 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,881 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,881 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,882 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,882 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,882 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,883 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,883 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,887 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,887 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,888 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,888 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:09,888 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,888 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,889 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:09,889 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,895 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,896 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,897 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,897 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:09,897 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:09,897 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,901 INFO L400 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-11-15 20:46:09,901 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:09,928 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:09,929 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:09,929 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:09,930 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:09,930 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:09,930 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:09,934 INFO L400 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2019-11-15 20:46:09,934 INFO L401 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2019-11-15 20:46:10,018 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,018 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,019 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,019 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,019 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,019 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,020 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,021 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,025 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,026 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,026 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,026 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,027 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,027 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,029 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,029 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,043 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,045 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,046 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,047 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,047 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,047 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,047 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,048 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,050 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,051 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,051 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,051 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,052 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,052 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,053 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,053 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,057 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,057 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,058 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,058 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,058 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,058 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,059 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,059 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,064 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,064 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,064 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,064 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,065 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,065 INFO L204 nArgumentSynthesizer]: 4 template conjuncts. [2019-11-15 20:46:10,065 INFO L400 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2019-11-15 20:46:10,065 INFO L401 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2019-11-15 20:46:10,067 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,068 INFO L489 LassoAnalysis]: Using template '4-nested'. [2019-11-15 20:46:10,068 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,068 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,068 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,068 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,069 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,069 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,069 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,071 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,071 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,072 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,072 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,072 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,072 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,073 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,073 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,074 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,075 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,076 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,076 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,079 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,080 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,080 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,083 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,083 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,084 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,084 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,085 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,085 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,085 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,090 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,090 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,090 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,090 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,091 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,091 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,093 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,094 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,094 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,095 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,095 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,099 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,099 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,100 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,100 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,100 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,101 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,101 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,102 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,102 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,102 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,104 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,105 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,105 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,107 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,107 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,107 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,108 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,108 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,108 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,108 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,108 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,109 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,110 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,111 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,111 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,111 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,112 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,112 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,112 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,113 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,113 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,113 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,113 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,113 INFO L400 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2019-11-15 20:46:10,114 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,114 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,115 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,115 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,115 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,115 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,115 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,117 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,117 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,122 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,123 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,123 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,123 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,124 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,124 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,125 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,125 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,133 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,134 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,134 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,134 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:10,135 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,135 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,140 INFO L400 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-11-15 20:46:10,140 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,172 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,173 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,173 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,173 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:10,174 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:10,174 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,179 INFO L400 nArgumentSynthesizer]: We have 50 Motzkin's Theorem applications. [2019-11-15 20:46:10,179 INFO L401 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2019-11-15 20:46:10,357 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,358 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,358 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,358 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,359 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,359 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,360 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,360 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,366 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,367 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,367 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,368 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,368 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,368 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,371 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,371 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,387 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,388 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,388 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,388 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,388 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,389 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,391 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,392 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,393 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,393 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,394 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,394 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,394 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,394 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,395 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,396 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,401 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,401 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,401 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,402 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,402 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,402 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,403 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,403 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,408 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,408 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,409 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:10,409 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,409 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,409 INFO L204 nArgumentSynthesizer]: 5 template conjuncts. [2019-11-15 20:46:10,410 INFO L400 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2019-11-15 20:46:10,410 INFO L401 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2019-11-15 20:46:10,412 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,413 INFO L489 LassoAnalysis]: Using template '2-phase'. [2019-11-15 20:46:10,413 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,413 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,414 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,414 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,414 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,414 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,415 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,415 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,417 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,417 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,417 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,417 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,417 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,418 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,418 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,418 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,419 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,424 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,425 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,425 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,425 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,425 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,425 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,426 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,426 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,426 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,429 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,429 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,429 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,429 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,430 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,430 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,430 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,431 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,431 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,433 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,433 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,433 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,433 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,433 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,434 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,434 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,434 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,434 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,434 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,435 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,435 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,436 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,436 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,436 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,436 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,436 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,436 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,437 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,437 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,438 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,438 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,438 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,438 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,438 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,439 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,439 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,439 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,440 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,441 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,442 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,442 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,442 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,442 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,442 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,443 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,443 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,443 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,446 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,447 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,447 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,447 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,447 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,448 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,448 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,448 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,448 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,448 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,449 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,449 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,450 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,450 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,450 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,450 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,450 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,450 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,451 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,451 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,452 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,452 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,452 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,453 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,453 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,453 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,453 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,454 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,454 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,456 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,456 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,456 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,456 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,457 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,457 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,457 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,457 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,457 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,458 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,458 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,459 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,459 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,459 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,459 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,459 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,460 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,460 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,460 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,460 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,461 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,461 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,461 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,462 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,462 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:10,462 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,462 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,462 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,463 INFO L400 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2019-11-15 20:46:10,463 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:10,463 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,464 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,464 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,464 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,464 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,464 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,465 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,465 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,466 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,470 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,470 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,470 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,470 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,471 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:10,471 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,471 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,472 INFO L400 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2019-11-15 20:46:10,472 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,480 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,480 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,481 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,481 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,481 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:10,481 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:10,481 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,484 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:10,485 INFO L401 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2019-11-15 20:46:10,515 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:10,515 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:10,516 WARN L332 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2019-11-15 20:46:10,516 INFO L337 nArgumentSynthesizer]: Template has degree 1. [2019-11-15 20:46:10,516 INFO L202 nArgumentSynthesizer]: 2 stem disjuncts [2019-11-15 20:46:10,516 INFO L203 nArgumentSynthesizer]: 2 loop disjuncts [2019-11-15 20:46:10,516 INFO L204 nArgumentSynthesizer]: 3 template conjuncts. [2019-11-15 20:46:10,520 INFO L400 nArgumentSynthesizer]: We have 30 Motzkin's Theorem applications. [2019-11-15 20:46:10,520 INFO L401 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2019-11-15 20:46:10,683 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:46:10,753 INFO L443 ModelExtractionUtils]: Simplification made 6 calls to the SMT solver. [2019-11-15 20:46:10,754 INFO L444 ModelExtractionUtils]: 28 out of 34 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:46:10,754 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:46:10,755 INFO L438 nArgumentSynthesizer]: Removed 6 redundant supporting invariants from a total of 6. [2019-11-15 20:46:10,756 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:46:10,756 INFO L512 LassoAnalysis]: Termination argument consisting of: Ranking function 2-phase ranking function: f0 = 1*v_rep(select (select #memory_int ULTIMATE.start_main_~z~0.base) ULTIMATE.start_main_~z~0.offset)_8 f1 = 1*v_rep(ite ULTIMATE.start_main_#t~short9 1 0)_8 Supporting invariants [] [2019-11-15 20:46:10,903 INFO L297 tatePredicateManager]: 23 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:46:10,905 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:46:10,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:46:10,906 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:46:10,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:10,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:10,969 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:46:10,970 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:10,985 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:10,985 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:46:10,986 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:10,994 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:10,994 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:10,994 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:46:11,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,008 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:46:11,008 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:11,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,075 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,076 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,085 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,093 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,093 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,100 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,112 INFO L375 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 61 treesize of output 30 [2019-11-15 20:46:11,112 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,118 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,130 INFO L375 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 68 treesize of output 33 [2019-11-15 20:46:11,131 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,138 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,138 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,208 INFO L567 ElimStorePlain]: treesize reduction 69, result has 46.9 percent of original size [2019-11-15 20:46:11,208 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:46:11,208 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:244, output treesize:47 [2019-11-15 20:46:11,241 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:11,242 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 [2019-11-15 20:46:11,242 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2019-11-15 20:46:11,367 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 8 states. [2019-11-15 20:46:11,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:46:11,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:46:11,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 20:46:11,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 20:46:11,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:11,368 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:46:11,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:11,409 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,410 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:46:11,411 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:11,424 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:11,424 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:46:11,424 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,430 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:11,430 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,430 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:46:11,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,440 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-15 20:46:11,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:11,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,493 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,494 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,504 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,509 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,510 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,516 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,521 INFO L375 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 61 treesize of output 30 [2019-11-15 20:46:11,522 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,526 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,532 INFO L375 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 68 treesize of output 33 [2019-11-15 20:46:11,532 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,537 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,538 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,616 INFO L567 ElimStorePlain]: treesize reduction 69, result has 46.9 percent of original size [2019-11-15 20:46:11,617 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:46:11,617 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:244, output treesize:47 [2019-11-15 20:46:11,657 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:11,658 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 [2019-11-15 20:46:11,658 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2019-11-15 20:46:11,753 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 312 states and 370 transitions. Complement of second has 8 states. [2019-11-15 20:46:11,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:46:11,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:46:11,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 19 transitions. [2019-11-15 20:46:11,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 19 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 20:46:11,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:11,756 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2019-11-15 20:46:11,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:11,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,801 INFO L256 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:46:11,802 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:11,809 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:11,809 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:46:11,809 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,820 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:11,820 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,820 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 2 variables, input treesize:21, output treesize:6 [2019-11-15 20:46:11,829 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:11,829 INFO L256 TraceCheckSpWp]: Trace formula consists of 42 conjuncts, 9 conjunts are in the unsatisfiable core [2019-11-15 20:46:11,830 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:11,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,874 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:11,880 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,885 INFO L375 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 61 treesize of output 30 [2019-11-15 20:46:11,886 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,890 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,904 INFO L375 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 68 treesize of output 33 [2019-11-15 20:46:11,904 INFO L496 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,910 INFO L189 IndexEqualityManager]: detected not equals via solver [2019-11-15 20:46:11,918 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,918 INFO L496 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,944 INFO L375 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 57 treesize of output 30 [2019-11-15 20:46:11,944 INFO L496 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:11,998 INFO L567 ElimStorePlain]: treesize reduction 69, result has 46.9 percent of original size [2019-11-15 20:46:11,998 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2019-11-15 20:46:11,999 INFO L221 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:244, output treesize:47 [2019-11-15 20:46:12,027 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 20:46:12,027 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 [2019-11-15 20:46:12,028 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50 Second operand 5 states. [2019-11-15 20:46:12,126 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 179 states and 218 transitions. cyclomatic complexity: 50. Second operand 5 states. Result 370 states and 448 transitions. Complement of second has 9 states. [2019-11-15 20:46:12,130 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 2 stem states 2 non-accepting loop states 1 accepting loop states [2019-11-15 20:46:12,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2019-11-15 20:46:12,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 25 transitions. [2019-11-15 20:46:12,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 7 letters. [2019-11-15 20:46:12,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:12,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 27 letters. Loop has 7 letters. [2019-11-15 20:46:12,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:12,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 25 transitions. Stem has 20 letters. Loop has 14 letters. [2019-11-15 20:46:12,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:12,131 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 370 states and 448 transitions. [2019-11-15 20:46:12,134 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2019-11-15 20:46:12,135 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 370 states to 196 states and 238 transitions. [2019-11-15 20:46:12,136 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2019-11-15 20:46:12,136 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2019-11-15 20:46:12,136 INFO L73 IsDeterministic]: Start isDeterministic. Operand 196 states and 238 transitions. [2019-11-15 20:46:12,136 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2019-11-15 20:46:12,136 INFO L688 BuchiCegarLoop]: Abstraction has 196 states and 238 transitions. [2019-11-15 20:46:12,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states and 238 transitions. [2019-11-15 20:46:12,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 154. [2019-11-15 20:46:12,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 154 states. [2019-11-15 20:46:12,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 154 states to 154 states and 187 transitions. [2019-11-15 20:46:12,142 INFO L711 BuchiCegarLoop]: Abstraction has 154 states and 187 transitions. [2019-11-15 20:46:12,142 INFO L591 BuchiCegarLoop]: Abstraction has 154 states and 187 transitions. [2019-11-15 20:46:12,142 INFO L424 BuchiCegarLoop]: ======== Iteration 10============ [2019-11-15 20:46:12,142 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 154 states and 187 transitions. [2019-11-15 20:46:12,143 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 49 [2019-11-15 20:46:12,143 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2019-11-15 20:46:12,143 INFO L119 BuchiIsEmpty]: Starting construction of run [2019-11-15 20:46:12,144 INFO L849 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1] [2019-11-15 20:46:12,144 INFO L850 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 2, 1, 1] [2019-11-15 20:46:12,144 INFO L791 eck$LassoCheckResult]: Stem: 5676#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 5671#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.allocOnStack(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.allocOnStack(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.allocOnStack(4);main_~z~0.base, main_~z~0.offset := main_#t~malloc4.base, main_#t~malloc4.offset; 5672#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5681#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; 5667#L551-3 main_#t~short9 := main_#t~short7; 5668#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; 5685#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 5686#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5678#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; 5752#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5750#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; 5748#L551-3 main_#t~short9 := main_#t~short7; 5746#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; 5745#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 5696#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5707#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; 5703#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5704#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; 5699#L551-3 main_#t~short9 := main_#t~short7; 5700#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; 5694#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 5695#L552 [2019-11-15 20:46:12,145 INFO L793 eck$LassoCheckResult]: Loop: 5695#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5754#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; 5751#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5749#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; 5747#L551-3 main_#t~short9 := main_#t~short7; 5744#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; 5745#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 5696#L552 assume !(0 != main_#t~nondet10);havoc main_#t~nondet10; 5707#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; 5703#L554-2 call main_#t~mem5 := read~int(main_~x~0.base, main_~x~0.offset, 4);main_#t~short7 := main_#t~mem5 > 0; 5704#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; 5699#L551-3 main_#t~short9 := main_#t~short7; 5700#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; 5694#L551-6 assume !!main_#t~short9;havoc main_#t~mem8;havoc main_#t~mem6;havoc main_#t~mem5;havoc main_#t~short9;havoc main_#t~short7; 5695#L552 [2019-11-15 20:46:12,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:12,145 INFO L82 PathProgramCache]: Analyzing trace with hash -1384291310, now seen corresponding path program 4 times [2019-11-15 20:46:12,145 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:12,145 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790902761] [2019-11-15 20:46:12,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,146 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,146 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:12,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,170 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:12,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:12,171 INFO L82 PathProgramCache]: Analyzing trace with hash 969712963, now seen corresponding path program 1 times [2019-11-15 20:46:12,171 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:12,171 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671016165] [2019-11-15 20:46:12,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,171 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:12,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,183 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:12,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:12,183 INFO L82 PathProgramCache]: Analyzing trace with hash -1247996012, now seen corresponding path program 5 times [2019-11-15 20:46:12,184 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 20:46:12,184 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480584130] [2019-11-15 20:46:12,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,184 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 20:46:12,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 20:46:12,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 20:46:12,216 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 20:46:12,654 WARN L191 SmtUtils]: Spent 436.00 ms on a formula simplification. DAG size of input: 137 DAG size of output: 97 [2019-11-15 20:46:13,604 WARN L191 SmtUtils]: Spent 888.00 ms on a formula simplification. DAG size of input: 221 DAG size of output: 148 [2019-11-15 20:46:13,895 WARN L191 SmtUtils]: Spent 257.00 ms on a formula simplification that was a NOOP. DAG size: 99 [2019-11-15 20:46:13,899 INFO L210 LassoAnalysis]: Preferences: [2019-11-15 20:46:13,900 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2019-11-15 20:46:13,900 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2019-11-15 20:46:13,900 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2019-11-15 20:46:13,900 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2019-11-15 20:46:13,900 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2019-11-15 20:46:13,900 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2019-11-15 20:46:13,900 INFO L130 ssoRankerPreferences]: Path of dumped script: [2019-11-15 20:46:13,900 INFO L131 ssoRankerPreferences]: Filename of dumped script: CookSeeZuleger-2013TACAS-Fig7b-alloca.i_Iteration10_Lasso [2019-11-15 20:46:13,901 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2019-11-15 20:46:13,901 INFO L274 LassoAnalysis]: Starting lasso preprocessing... [2019-11-15 20:46:13,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,906 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,909 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,911 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,914 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,916 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,919 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,922 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,924 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,933 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,939 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:13,944 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2019-11-15 20:46:14,293 WARN L191 SmtUtils]: Spent 244.00 ms on a formula simplification. DAG size of input: 82 DAG size of output: 71 [2019-11-15 20:46:14,404 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 64 DAG size of output: 61 [2019-11-15 20:46:14,982 WARN L191 SmtUtils]: Spent 300.00 ms on a formula simplification. DAG size of input: 38 DAG size of output: 38 [2019-11-15 20:46:15,074 INFO L292 LassoAnalysis]: Preprocessing complete. [2019-11-15 20:46:15,074 INFO L489 LassoAnalysis]: Using template 'affine'. [2019-11-15 20:46:15,074 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,075 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,075 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,075 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,075 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,076 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,076 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,077 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,077 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,077 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,077 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,077 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,077 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,078 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,078 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,078 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,079 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,079 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,079 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,079 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,079 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,079 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,079 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,079 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,080 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,080 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,080 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,080 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,080 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,080 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,080 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,080 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,081 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,081 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,081 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,081 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,081 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,081 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,081 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,082 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,082 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,082 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,082 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,082 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,082 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,082 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,083 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,083 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,083 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,083 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,083 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,083 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,083 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,084 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,084 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,084 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,084 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,084 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,084 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,085 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,085 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,085 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,085 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,085 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,086 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,086 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,086 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,086 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,086 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,087 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,087 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,087 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,087 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,089 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,090 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,090 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,090 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,091 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,091 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,091 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,091 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,092 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,092 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,092 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,093 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,093 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,093 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,093 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,093 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,094 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,094 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,094 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,094 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,094 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,095 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,095 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,095 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,095 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,095 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,096 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,096 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,096 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,096 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,096 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,097 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,097 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,097 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,097 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,097 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,097 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,098 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,098 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,098 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,098 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,099 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,099 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,099 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,099 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,099 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,099 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,100 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,100 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,100 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,100 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,100 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,101 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,101 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,101 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,101 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,101 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,102 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,102 INFO L350 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2019-11-15 20:46:15,102 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,102 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,102 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,103 INFO L400 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2019-11-15 20:46:15,103 INFO L401 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2019-11-15 20:46:15,103 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,103 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,104 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,104 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,104 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,104 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,104 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,105 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,105 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,106 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,106 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,106 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,106 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,107 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,107 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,107 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,109 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,110 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,110 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,110 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,110 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,110 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,111 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,111 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,113 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,113 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,114 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,114 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,114 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,114 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,115 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,115 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,117 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,117 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,117 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,118 INFO L202 nArgumentSynthesizer]: 8 stem disjuncts [2019-11-15 20:46:15,118 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,118 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,120 INFO L400 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2019-11-15 20:46:15,120 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,130 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,130 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,130 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,131 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,131 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,131 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,131 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,131 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,132 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,132 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,133 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,133 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,133 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,133 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,134 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,134 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,136 INFO L522 LassoAnalysis]: Proving termination failed for this template and these settings. [2019-11-15 20:46:15,136 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2019-11-15 20:46:15,136 INFO L337 nArgumentSynthesizer]: Template has degree 0. [2019-11-15 20:46:15,136 INFO L202 nArgumentSynthesizer]: 1 stem disjuncts [2019-11-15 20:46:15,137 INFO L203 nArgumentSynthesizer]: 1 loop disjuncts [2019-11-15 20:46:15,137 INFO L204 nArgumentSynthesizer]: 2 template conjuncts. [2019-11-15 20:46:15,137 INFO L400 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2019-11-15 20:46:15,137 INFO L401 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2019-11-15 20:46:15,140 INFO L419 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2019-11-15 20:46:15,142 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2019-11-15 20:46:15,142 INFO L444 ModelExtractionUtils]: 3 out of 7 variables were initially zero. Simplification set additionally 2 variables to zero. [2019-11-15 20:46:15,142 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2019-11-15 20:46:15,143 INFO L438 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2019-11-15 20:46:15,143 INFO L510 LassoAnalysis]: Proved termination. [2019-11-15 20:46:15,143 INFO L512 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 [] [2019-11-15 20:46:15,234 INFO L297 tatePredicateManager]: 22 out of 24 supporting invariants were superfluous and have been removed [2019-11-15 20:46:15,241 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-11-15 20:46:15,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 20:46:15,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:15,290 INFO L256 TraceCheckSpWp]: Trace formula consists of 139 conjuncts, 12 conjunts are in the unsatisfiable core [2019-11-15 20:46:15,290 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:15,303 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:15,304 INFO L375 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 27 [2019-11-15 20:46:15,304 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,311 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:15,311 INFO L496 ElimStorePlain]: Start of recursive call 1: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,311 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 1 variables, input treesize:21, output treesize:14 [2019-11-15 20:46:15,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 20:46:15,345 INFO L256 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 10 conjunts are in the unsatisfiable core [2019-11-15 20:46:15,346 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2019-11-15 20:46:15,373 INFO L341 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:15,373 INFO L375 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 2 case distinctions, treesize of input 47 treesize of output 51 [2019-11-15 20:46:15,373 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,390 INFO L567 ElimStorePlain]: treesize reduction 16, result has 59.0 percent of original size [2019-11-15 20:46:15,390 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,390 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:16 [2019-11-15 20:46:15,398 INFO L375 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 47 treesize of output 20 [2019-11-15 20:46:15,398 INFO L496 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,405 INFO L567 ElimStorePlain]: treesize reduction 0, result has 100.0 percent of original size [2019-11-15 20:46:15,406 INFO L496 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2019-11-15 20:46:15,406 INFO L221 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:55, output treesize:18 [2019-11-15 20:46:15,417 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:15,443 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-11-15 20:46:15,485 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2019-11-15 20:46:15,485 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 [2019-11-15 20:46:15,485 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 154 states and 187 transitions. cyclomatic complexity: 42 Second operand 8 states. [2019-11-15 20:46:15,603 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 154 states and 187 transitions. cyclomatic complexity: 42. Second operand 8 states. Result 411 states and 509 transitions. Complement of second has 11 states. [2019-11-15 20:46:15,607 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 [2019-11-15 20:46:15,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2019-11-15 20:46:15,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 23 transitions. [2019-11-15 20:46:15,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 14 letters. [2019-11-15 20:46:15,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:15,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 35 letters. Loop has 14 letters. [2019-11-15 20:46:15,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:15,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 7 states and 23 transitions. Stem has 21 letters. Loop has 28 letters. [2019-11-15 20:46:15,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2019-11-15 20:46:15,609 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 411 states and 509 transitions. [2019-11-15 20:46:15,611 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:46:15,611 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 411 states to 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2019-11-15 20:46:15,612 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2019-11-15 20:46:15,612 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2019-11-15 20:46:15,612 INFO L688 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L711 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L591 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L424 BuchiCegarLoop]: ======== Iteration 11============ [2019-11-15 20:46:15,612 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2019-11-15 20:46:15,612 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2019-11-15 20:46:15,612 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2019-11-15 20:46:15,618 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 15.11 08:46:15 BoogieIcfgContainer [2019-11-15 20:46:15,618 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2019-11-15 20:46:15,619 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 20:46:15,619 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 20:46:15,619 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 20:46:15,619 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 08:39:07" (3/4) ... [2019-11-15 20:46:15,622 INFO L140 WitnessPrinter]: No result that supports witness generation found [2019-11-15 20:46:15,623 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 20:46:15,624 INFO L168 Benchmark]: Toolchain (without parser) took 429576.44 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 548.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -199.7 MB). Peak memory consumption was 348.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:15,624 INFO L168 Benchmark]: CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:15,624 INFO L168 Benchmark]: CACSL2BoogieTranslator took 629.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:15,625 INFO L168 Benchmark]: Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:15,625 INFO L168 Benchmark]: Boogie Preprocessor took 23.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:15,625 INFO L168 Benchmark]: RCFGBuilder took 365.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:15,626 INFO L168 Benchmark]: BuchiAutomizer took 428510.20 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 384.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.3 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. [2019-11-15 20:46:15,626 INFO L168 Benchmark]: Witness Printer took 4.04 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 20:46:15,627 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.34 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 629.69 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 163.6 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -201.2 MB). Peak memory consumption was 18.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 39.48 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.7 MB). Peak memory consumption was 8.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 23.18 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 365.78 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 22.1 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 428510.20 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 384.8 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: -29.3 MB). Peak memory consumption was 355.5 MB. Max. memory is 11.5 GB. * Witness Printer took 4.04 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 10 terminating modules (1 trivial, 5 deterministic, 4 nondeterministic). One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 6 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One deterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 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 nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 5 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[x][x] and consists of 12 locations. One nondeterministic module has affine ranking function unknown-#memory_int-unknown[y][y] and consists of 7 locations. One nondeterministic module has 2-phase ranking function (if unknown-#memory_int-unknown[z][z] > 0 then 1 else 0), (if unknown-#memory_int-unknown[z][z] > 0 then unknown-#memory_int-unknown[z][z] else (if aux-*x > 0 && *y > 0 && *z > 0-aux then 1 else 0)) and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 4 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 428.4s and 11 iterations. TraceHistogramMax:3. Analysis of lassos took 31.6s. Construction of modules took 386.7s. Büchi inclusion checks took 9.7s. Highest rank in rank-based complementation 3. Minimization of det autom 1. Minimization of nondet autom 9. Automata minimization 0.1s AutomataMinimizationTime, 9 MinimizatonAttempts, 179 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 179 states and ocurred in iteration 8. Nontrivial modules had stage [5, 0, 4, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 13/13 HoareTripleCheckerStatistics: 170 SDtfs, 362 SDslu, 132 SDs, 0 SdLazy, 583 SolverSat, 134 SolverUnsat, 32 SolverUnknown, 0 SolverNotchecked, 386.7s Time LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT0 SILN0 SILU0 SILI0 SILT0 lasso9 LassoPreprocessingBenchmarks: Lassos: inital494 mio100 ax104 hnf99 lsp77 ukn69 mio100 lsp32 div100 bol101 ite100 ukn100 eq186 hnf88 smp97 dnf306 smp92 tf100 neg92 sie126 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 7 VariablesLoop: 6 DisjunctsStem: 8 DisjunctsLoop: 1 SupportingInvariants: 5 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...