./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash ce8a7f5b0345c6213ba7b1864c5b0de301a874d7 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. Execution finished normally Using bit-precise analysis No suitable file found in config dir /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/config using search string *Termination*64bit*_Bitvector*.epf No suitable settings file found using Termination*64bit*_Bitvector ERROR: UNSUPPORTED PROPERTY Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-22 23:29:41,103 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-22 23:29:41,105 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-22 23:29:41,111 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-22 23:29:41,111 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-22 23:29:41,112 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-22 23:29:41,113 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-22 23:29:41,114 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-22 23:29:41,115 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-22 23:29:41,115 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-22 23:29:41,116 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-22 23:29:41,116 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-22 23:29:41,117 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-22 23:29:41,118 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-22 23:29:41,118 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-22 23:29:41,118 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-22 23:29:41,119 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-22 23:29:41,120 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-22 23:29:41,121 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-22 23:29:41,122 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-22 23:29:41,122 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-22 23:29:41,123 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-22 23:29:41,125 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-22 23:29:41,125 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-22 23:29:41,125 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-22 23:29:41,126 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-22 23:29:41,126 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-22 23:29:41,127 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-22 23:29:41,127 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-22 23:29:41,128 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-22 23:29:41,128 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-22 23:29:41,129 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-22 23:29:41,129 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-22 23:29:41,129 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-22 23:29:41,130 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-22 23:29:41,130 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-22 23:29:41,130 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-22 23:29:41,140 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-22 23:29:41,141 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-22 23:29:41,142 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-22 23:29:41,142 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-22 23:29:41,142 INFO L133 SettingsManager]: * Use SBE=true [2018-11-22 23:29:41,142 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-22 23:29:41,142 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-22 23:29:41,143 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-22 23:29:41,143 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-22 23:29:41,144 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-22 23:29:41,144 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-22 23:29:41,144 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-22 23:29:41,144 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-22 23:29:41,144 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-22 23:29:41,145 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-22 23:29:41,146 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-22 23:29:41,146 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-22 23:29:41,146 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-22 23:29:41,146 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-22 23:29:41,146 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-22 23:29:41,146 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-22 23:29:41,146 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-22 23:29:41,147 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-22 23:29:41,147 INFO L133 SettingsManager]: * TransformationType=MODULO_NEIGHBOR Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(F end) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> ce8a7f5b0345c6213ba7b1864c5b0de301a874d7 [2018-11-22 23:29:41,171 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-22 23:29:41,180 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-22 23:29:41,182 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-22 23:29:41,183 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-22 23:29:41,183 INFO L276 PluginConnector]: CDTParser initialized [2018-11-22 23:29:41,184 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/../../sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i [2018-11-22 23:29:41,227 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/data/2b19838f4/24c5c613951d4ef593e5a47c603292d3/FLAG5cfec4772 [2018-11-22 23:29:41,637 INFO L307 CDTParser]: Found 1 translation units. [2018-11-22 23:29:41,637 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/sv-benchmarks/c/termination-recursive-malloc/rec_malloc_ex5B_true-termination.c.i [2018-11-22 23:29:41,641 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/data/2b19838f4/24c5c613951d4ef593e5a47c603292d3/FLAG5cfec4772 [2018-11-22 23:29:41,651 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/data/2b19838f4/24c5c613951d4ef593e5a47c603292d3 [2018-11-22 23:29:41,654 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-22 23:29:41,655 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-22 23:29:41,655 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-22 23:29:41,655 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-22 23:29:41,658 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-22 23:29:41,659 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,661 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7ee0313 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41, skipping insertion in model container [2018-11-22 23:29:41,661 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,670 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-22 23:29:41,686 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-22 23:29:41,790 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:29:41,795 INFO L191 MainTranslator]: Completed pre-run [2018-11-22 23:29:41,808 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-22 23:29:41,817 INFO L195 MainTranslator]: Completed translation [2018-11-22 23:29:41,818 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41 WrapperNode [2018-11-22 23:29:41,818 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-22 23:29:41,818 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-22 23:29:41,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-22 23:29:41,818 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-22 23:29:41,823 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,830 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,841 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-22 23:29:41,841 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-22 23:29:41,841 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-22 23:29:41,841 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-22 23:29:41,882 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,882 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,884 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,884 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,886 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,889 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,890 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... [2018-11-22 23:29:41,891 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-22 23:29:41,891 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-22 23:29:41,891 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-22 23:29:41,891 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-22 23:29:41,892 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:29:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-22 23:29:41,927 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-22 23:29:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure f [2018-11-22 23:29:41,928 INFO L138 BoogieDeclarations]: Found implementation of procedure f [2018-11-22 23:29:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure g [2018-11-22 23:29:41,928 INFO L138 BoogieDeclarations]: Found implementation of procedure g [2018-11-22 23:29:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-22 23:29:41,928 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-22 23:29:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-22 23:29:41,928 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-11-22 23:29:42,105 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-22 23:29:42,105 INFO L280 CfgBuilder]: Removed 5 assue(true) statements. [2018-11-22 23:29:42,105 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:29:42 BoogieIcfgContainer [2018-11-22 23:29:42,105 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-22 23:29:42,106 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-22 23:29:42,106 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-22 23:29:42,109 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-22 23:29:42,110 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:29:42,110 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 22.11 11:29:41" (1/3) ... [2018-11-22 23:29:42,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c33cd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:29:42, skipping insertion in model container [2018-11-22 23:29:42,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:29:42,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.11 11:29:41" (2/3) ... [2018-11-22 23:29:42,111 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@2c33cd51 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 22.11 11:29:42, skipping insertion in model container [2018-11-22 23:29:42,111 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-22 23:29:42,111 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.11 11:29:42" (3/3) ... [2018-11-22 23:29:42,113 INFO L375 chiAutomizerObserver]: Analyzing ICFG rec_malloc_ex5B_true-termination.c.i [2018-11-22 23:29:42,151 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-22 23:29:42,152 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-22 23:29:42,152 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-22 23:29:42,152 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-22 23:29:42,152 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-22 23:29:42,152 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-22 23:29:42,152 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-22 23:29:42,152 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-22 23:29:42,152 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-22 23:29:42,163 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-22 23:29:42,181 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:42,181 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:42,181 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:42,186 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:29:42,186 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:42,186 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-22 23:29:42,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 27 states. [2018-11-22 23:29:42,188 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:42,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:42,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:42,189 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:29:42,189 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:42,195 INFO L794 eck$LassoCheckResult]: Stem: 27#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 11#L76true assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 8#L76-2true assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 20#L79true call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 9#fENTRYtrue [2018-11-22 23:29:42,195 INFO L796 eck$LassoCheckResult]: Loop: 9#fENTRYtrue ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 26#L17true assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 10#L25true call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 28#gENTRYtrue ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 15#L47true assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 5#gFINALtrue assume true; 25#gEXITtrue >#53#return; 14#L25-1true call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 9#fENTRYtrue [2018-11-22 23:29:42,200 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:42,200 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 1 times [2018-11-22 23:29:42,201 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:42,202 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:42,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:42,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:42,301 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:42,301 INFO L82 PathProgramCache]: Analyzing trace with hash -1039736561, now seen corresponding path program 1 times [2018-11-22 23:29:42,301 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:42,301 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,302 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:42,302 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:42,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:42,436 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:29:42,437 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-22 23:29:42,439 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:29:42,449 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-22 23:29:42,449 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-22 23:29:42,450 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 6 states. [2018-11-22 23:29:42,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:42,536 INFO L93 Difference]: Finished difference Result 31 states and 40 transitions. [2018-11-22 23:29:42,536 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-22 23:29:42,537 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 31 states and 40 transitions. [2018-11-22 23:29:42,539 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:42,545 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 31 states to 27 states and 34 transitions. [2018-11-22 23:29:42,546 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 27 [2018-11-22 23:29:42,547 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 27 [2018-11-22 23:29:42,547 INFO L73 IsDeterministic]: Start isDeterministic. Operand 27 states and 34 transitions. [2018-11-22 23:29:42,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:29:42,549 INFO L705 BuchiCegarLoop]: Abstraction has 27 states and 34 transitions. [2018-11-22 23:29:42,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states and 34 transitions. [2018-11-22 23:29:42,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 25. [2018-11-22 23:29:42,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-11-22 23:29:42,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 32 transitions. [2018-11-22 23:29:42,571 INFO L728 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-22 23:29:42,572 INFO L608 BuchiCegarLoop]: Abstraction has 25 states and 32 transitions. [2018-11-22 23:29:42,572 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-22 23:29:42,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 25 states and 32 transitions. [2018-11-22 23:29:42,573 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:42,573 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:42,573 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:42,574 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:29:42,574 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:42,574 INFO L794 eck$LassoCheckResult]: Stem: 91#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 88#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 89#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 90#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 70#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 71#fENTRY [2018-11-22 23:29:42,575 INFO L796 eck$LassoCheckResult]: Loop: 71#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 87#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 76#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 78#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 92#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 75#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 78#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 92#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 83#gFINAL assume true; 84#gEXIT >#59#return; 81#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 82#gFINAL assume true; 94#gEXIT >#53#return; 73#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 71#fENTRY [2018-11-22 23:29:42,575 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:42,575 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 2 times [2018-11-22 23:29:42,575 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:42,575 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,576 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:42,576 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:42,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:42,601 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:42,602 INFO L82 PathProgramCache]: Analyzing trace with hash -1707443993, now seen corresponding path program 1 times [2018-11-22 23:29:42,602 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:42,602 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:42,602 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,602 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:42,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:42,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 23:29:42,710 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:29:42,710 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:29:42,716 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:42,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:42,736 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:42,763 INFO L478 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 13 treesize of output 10 [2018-11-22 23:29:42,765 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-22 23:29:42,766 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:42,768 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:42,790 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:42,790 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:18, output treesize:7 [2018-11-22 23:29:42,871 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-11-22 23:29:42,886 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:29:42,886 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 13 [2018-11-22 23:29:42,886 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-22 23:29:42,886 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-22 23:29:42,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2018-11-22 23:29:42,887 INFO L87 Difference]: Start difference. First operand 25 states and 32 transitions. cyclomatic complexity: 10 Second operand 13 states. [2018-11-22 23:29:43,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:43,096 INFO L93 Difference]: Finished difference Result 30 states and 38 transitions. [2018-11-22 23:29:43,096 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-22 23:29:43,097 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 30 states and 38 transitions. [2018-11-22 23:29:43,098 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:43,098 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 30 states to 30 states and 38 transitions. [2018-11-22 23:29:43,098 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 30 [2018-11-22 23:29:43,099 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 30 [2018-11-22 23:29:43,099 INFO L73 IsDeterministic]: Start isDeterministic. Operand 30 states and 38 transitions. [2018-11-22 23:29:43,099 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-22 23:29:43,099 INFO L705 BuchiCegarLoop]: Abstraction has 30 states and 38 transitions. [2018-11-22 23:29:43,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states and 38 transitions. [2018-11-22 23:29:43,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 28. [2018-11-22 23:29:43,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-22 23:29:43,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2018-11-22 23:29:43,101 INFO L728 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-22 23:29:43,101 INFO L608 BuchiCegarLoop]: Abstraction has 28 states and 36 transitions. [2018-11-22 23:29:43,101 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-22 23:29:43,101 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 28 states and 36 transitions. [2018-11-22 23:29:43,102 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2018-11-22 23:29:43,102 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:43,102 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:43,102 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1] [2018-11-22 23:29:43,103 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:43,103 INFO L794 eck$LassoCheckResult]: Stem: 207#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 204#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 205#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 206#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 186#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 187#fENTRY [2018-11-22 23:29:43,103 INFO L796 eck$LassoCheckResult]: Loop: 187#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 203#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 189#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 188#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 188#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 191#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 208#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 210#gFINAL assume true; 213#gEXIT >#59#return; 195#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 196#gFINAL assume true; 199#gEXIT >#59#return; 201#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 212#gFINAL assume true; 211#gEXIT >#53#return; 192#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 187#fENTRY [2018-11-22 23:29:43,103 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:43,103 INFO L82 PathProgramCache]: Analyzing trace with hash 60187955, now seen corresponding path program 3 times [2018-11-22 23:29:43,103 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:43,103 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,104 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:43,104 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,118 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:43,118 INFO L82 PathProgramCache]: Analyzing trace with hash 705855503, now seen corresponding path program 2 times [2018-11-22 23:29:43,118 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:43,118 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,119 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:43,119 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,153 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:43,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1432639553, now seen corresponding path program 1 times [2018-11-22 23:29:43,153 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:43,153 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,154 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:43,154 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:43,173 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:43,488 WARN L180 SmtUtils]: Spent 144.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-22 23:29:43,809 WARN L180 SmtUtils]: Spent 198.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-22 23:29:44,200 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 131 DAG size of output: 121 [2018-11-22 23:29:44,471 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-22 23:29:44,611 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:29:44,612 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:29:44,612 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:29:44,612 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:29:44,612 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:29:44,613 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:29:44,613 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:29:44,613 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:29:44,613 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration3_Lasso [2018-11-22 23:29:44,613 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:29:44,613 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:29:44,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,635 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,637 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,640 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,641 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,643 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,645 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,646 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,647 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,648 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,649 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,650 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,651 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,652 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,654 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,655 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,656 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,658 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,660 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,661 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,663 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,664 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,666 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,667 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,668 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,670 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,673 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,674 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,675 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,677 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,678 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,679 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,681 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,682 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,683 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:44,946 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:29:44,950 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:29:44,951 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,953 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,953 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,953 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,953 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,954 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,955 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,955 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,956 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,956 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,957 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,957 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,957 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,957 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,957 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,958 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,958 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,959 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,959 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,959 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,959 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,959 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,960 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,960 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,960 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,960 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,961 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,961 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,961 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,962 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,962 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,962 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,962 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,962 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,963 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,963 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,964 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,964 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,965 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,965 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,966 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,966 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,966 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,966 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,966 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,966 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,967 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,967 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,967 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,968 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,968 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,968 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,968 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,968 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,968 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,969 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,969 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,969 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,970 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,970 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,970 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,970 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,970 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,970 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,971 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,971 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,972 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,972 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,972 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,972 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,972 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,972 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,973 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,973 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,974 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,974 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,974 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,974 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,974 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,975 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,975 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,975 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,976 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,976 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,976 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,977 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,977 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,977 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,977 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,978 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,979 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,979 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,979 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,979 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,979 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,979 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,980 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,981 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,981 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,982 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,983 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,983 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,984 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,984 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,984 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,985 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,985 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,986 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,987 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:44,987 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:44,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,989 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,990 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,990 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,992 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,993 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,993 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,994 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,994 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,994 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,994 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,995 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,995 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,995 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,996 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,996 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,997 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,997 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,997 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:44,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:44,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:44,999 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:44,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:44,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:44,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:44,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:44,999 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:44,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,001 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,002 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,003 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,004 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,004 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,005 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,005 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,005 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,006 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,006 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,006 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,007 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,007 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,008 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,008 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,009 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,009 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,010 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,010 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,010 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,010 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,010 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,011 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,012 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,012 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,014 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,014 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,014 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,015 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,015 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,016 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,017 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,017 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,018 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,018 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,018 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,019 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,019 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,019 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,019 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,020 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,021 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,021 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,021 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,022 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,023 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,023 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,023 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,023 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,023 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,023 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,024 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,025 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,025 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,025 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,026 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,026 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,028 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,028 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,028 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,030 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,031 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,031 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,031 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,032 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,033 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:45,033 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:45,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,036 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,036 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,037 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,037 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,038 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,038 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,038 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,038 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,038 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,039 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,039 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,040 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,040 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,040 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,040 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,040 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,042 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,042 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,042 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,047 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,048 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,048 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,050 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,053 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,055 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,057 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,058 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:45,058 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,059 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,059 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,059 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,059 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,059 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:29:45,059 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:29:45,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,063 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:45,063 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:45,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,069 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,070 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:29:45,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,070 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:29:45,070 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,071 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:45,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,072 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-22 23:29:45,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,073 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-22 23:29:45,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:45,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,074 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,076 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:45,076 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:45,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:45,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:45,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:45,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:45,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:45,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:45,080 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:45,080 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:45,088 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:29:45,091 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 23:29:45,091 INFO L444 ModelExtractionUtils]: 4 out of 7 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 23:29:45,093 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:29:45,093 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:29:45,094 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:29:45,094 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(f_#in~v) = 2*f_#in~v + 1 Supporting invariants [] [2018-11-22 23:29:45,097 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 23:29:45,115 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:45,126 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:45,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:45,154 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:45,189 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2018-11-22 23:29:45,191 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 4 loop predicates [2018-11-22 23:29:45,191 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11 Second operand 5 states. [2018-11-22 23:29:45,257 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 28 states and 36 transitions. cyclomatic complexity: 11. Second operand 5 states. Result 90 states and 107 transitions. Complement of second has 16 states. [2018-11-22 23:29:45,258 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:45,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:29:45,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 20 transitions. [2018-11-22 23:29:45,261 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 20 letters. [2018-11-22 23:29:45,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:45,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 25 letters. Loop has 20 letters. [2018-11-22 23:29:45,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:45,263 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 20 transitions. Stem has 5 letters. Loop has 40 letters. [2018-11-22 23:29:45,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:45,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 107 transitions. [2018-11-22 23:29:45,266 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-22 23:29:45,267 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 61 states and 76 transitions. [2018-11-22 23:29:45,267 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-22 23:29:45,267 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 37 [2018-11-22 23:29:45,268 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 76 transitions. [2018-11-22 23:29:45,268 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:45,268 INFO L705 BuchiCegarLoop]: Abstraction has 61 states and 76 transitions. [2018-11-22 23:29:45,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 76 transitions. [2018-11-22 23:29:45,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 44. [2018-11-22 23:29:45,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-22 23:29:45,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 53 transitions. [2018-11-22 23:29:45,272 INFO L728 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-22 23:29:45,272 INFO L608 BuchiCegarLoop]: Abstraction has 44 states and 53 transitions. [2018-11-22 23:29:45,272 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-22 23:29:45,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 44 states and 53 transitions. [2018-11-22 23:29:45,273 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-22 23:29:45,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:45,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:45,273 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:45,274 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:29:45,274 INFO L794 eck$LassoCheckResult]: Stem: 452#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 449#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 450#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 451#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 421#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 422#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 446#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 428#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 427#gENTRY [2018-11-22 23:29:45,274 INFO L796 eck$LassoCheckResult]: Loop: 427#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 453#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 426#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 427#gENTRY [2018-11-22 23:29:45,274 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:45,274 INFO L82 PathProgramCache]: Analyzing trace with hash 2058005149, now seen corresponding path program 1 times [2018-11-22 23:29:45,274 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:45,274 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,275 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:45,275 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,290 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:45,290 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 1 times [2018-11-22 23:29:45,290 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:45,290 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,291 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:45,291 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,296 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:45,296 INFO L82 PathProgramCache]: Analyzing trace with hash -626731559, now seen corresponding path program 1 times [2018-11-22 23:29:45,296 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:45,297 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,297 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:45,297 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:45,620 WARN L180 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-11-22 23:29:45,874 WARN L180 SmtUtils]: Spent 177.00 ms on a formula simplification. DAG size of input: 99 DAG size of output: 98 [2018-11-22 23:29:45,919 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:29:45,919 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:29:45,919 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:29:45,920 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:29:45,920 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:29:45,920 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:29:45,920 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:29:45,920 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:29:45,920 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration4_Lasso [2018-11-22 23:29:45,920 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:29:45,920 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:29:45,923 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,927 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,928 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,930 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,932 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,935 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,936 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,937 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,938 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,940 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,942 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,943 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,945 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,948 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,950 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,951 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,952 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,953 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,954 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,956 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,957 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,958 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,959 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,961 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,962 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,963 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,964 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,965 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,966 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,967 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,969 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,971 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,977 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,978 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,981 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:45,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,054 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,056 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,064 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:46,238 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:29:46,239 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:29:46,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,240 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,241 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,246 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,246 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,247 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,247 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,248 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,249 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,250 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,250 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,250 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,251 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,252 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,252 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,252 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,253 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,253 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,254 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,254 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,255 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,255 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,257 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,258 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,258 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,258 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,258 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,260 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,260 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,261 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,261 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,261 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,261 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,262 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,262 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,264 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,264 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,265 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,266 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,266 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,267 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,269 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,269 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,270 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,271 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,272 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,272 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,273 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,274 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,275 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,275 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,275 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,275 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,276 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,276 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,277 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,277 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,277 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,278 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,278 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,278 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,278 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,278 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,278 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,279 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,279 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,281 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,282 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,283 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,284 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,287 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,290 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,290 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,290 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,290 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,290 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,290 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,290 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,291 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,293 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,294 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,295 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,295 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,296 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,296 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,296 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,297 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,297 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,297 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,298 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,298 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,298 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,299 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,303 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,304 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,304 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,305 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,305 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,306 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,306 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,306 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,306 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,307 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,307 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,307 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,307 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,307 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,307 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,308 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,308 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,309 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,309 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,310 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,310 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,310 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,310 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,310 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,310 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,310 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,311 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,312 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,312 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,313 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,314 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,314 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,315 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,315 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,315 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,315 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,315 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,315 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,316 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,316 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,316 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,317 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,317 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,317 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,317 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,318 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,318 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,318 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,320 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,320 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,320 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,320 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,320 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,321 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,322 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,323 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,323 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,324 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,324 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,325 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,325 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,325 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,326 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,326 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,326 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,326 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,326 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,327 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,328 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,328 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,329 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,329 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,329 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,329 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,330 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,330 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,331 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,331 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,331 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,331 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,331 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,331 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,332 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,332 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:46,332 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,332 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,332 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,333 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:46,333 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:46,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,333 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,334 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,336 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:46,336 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,336 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,337 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:46,337 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,340 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:46,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,341 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:46,341 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,344 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,344 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,348 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:46,348 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,348 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,348 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:46,348 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,351 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,351 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,351 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:46,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:46,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:46,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:46,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:46,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:46,357 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:46,357 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:46,367 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:29:46,370 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 23:29:46,370 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 23:29:46,370 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:29:46,371 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:29:46,371 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:29:46,371 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_1 + 1 Supporting invariants [] [2018-11-22 23:29:46,410 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 23:29:46,426 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:29:46,551 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:46,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:46,570 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:46,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:46,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:46,596 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:46,597 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 23:29:46,602 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:46,603 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 23:29:46,603 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,607 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,611 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 23:29:46,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:46,619 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 3 loop predicates [2018-11-22 23:29:46,619 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14 Second operand 4 states. [2018-11-22 23:29:46,658 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 44 states and 53 transitions. cyclomatic complexity: 14. Second operand 4 states. Result 71 states and 84 transitions. Complement of second has 15 states. [2018-11-22 23:29:46,659 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:46,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2018-11-22 23:29:46,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 14 transitions. [2018-11-22 23:29:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 3 letters. [2018-11-22 23:29:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 11 letters. Loop has 3 letters. [2018-11-22 23:29:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:46,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 14 transitions. Stem has 8 letters. Loop has 6 letters. [2018-11-22 23:29:46,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:46,661 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 71 states and 84 transitions. [2018-11-22 23:29:46,662 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-22 23:29:46,663 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 71 states to 54 states and 66 transitions. [2018-11-22 23:29:46,663 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 25 [2018-11-22 23:29:46,663 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 25 [2018-11-22 23:29:46,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 54 states and 66 transitions. [2018-11-22 23:29:46,664 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:46,664 INFO L705 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-22 23:29:46,664 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states and 66 transitions. [2018-11-22 23:29:46,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2018-11-22 23:29:46,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-22 23:29:46,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 66 transitions. [2018-11-22 23:29:46,668 INFO L728 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-22 23:29:46,668 INFO L608 BuchiCegarLoop]: Abstraction has 54 states and 66 transitions. [2018-11-22 23:29:46,668 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-22 23:29:46,668 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 54 states and 66 transitions. [2018-11-22 23:29:46,669 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-22 23:29:46,669 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:46,669 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:46,670 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:46,670 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:29:46,670 INFO L794 eck$LassoCheckResult]: Stem: 642#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 639#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 640#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 641#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 609#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 610#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 637#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 638#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 644#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 645#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 626#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 659#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 658#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 627#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 659#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 655#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 632#gFINAL assume true; 633#gEXIT >#59#return; 625#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 628#gFINAL assume true; 654#gEXIT >#59#return; 653#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 652#gFINAL assume true; 649#gEXIT >#53#return; 618#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 646#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 636#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 612#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 613#gENTRY [2018-11-22 23:29:46,670 INFO L796 eck$LassoCheckResult]: Loop: 613#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 643#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 611#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 613#gENTRY [2018-11-22 23:29:46,670 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:46,670 INFO L82 PathProgramCache]: Analyzing trace with hash 674903247, now seen corresponding path program 2 times [2018-11-22 23:29:46,670 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:46,670 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:46,671 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:46,671 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:46,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:46,792 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 23:29:46,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:29:46,792 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:29:46,808 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:29:46,847 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:29:46,847 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:29:46,852 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:46,862 INFO L478 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 13 treesize of output 10 [2018-11-22 23:29:46,865 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-22 23:29:46,865 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,870 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,872 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,872 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:13, output treesize:9 [2018-11-22 23:29:46,988 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 17 treesize of output 13 [2018-11-22 23:29:46,991 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 3 [2018-11-22 23:29:46,993 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,995 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,996 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:46,997 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:17, output treesize:3 [2018-11-22 23:29:47,001 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2018-11-22 23:29:47,026 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:29:47,027 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 17 [2018-11-22 23:29:47,027 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:29:47,027 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:47,027 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 2 times [2018-11-22 23:29:47,027 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:47,027 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,028 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:47,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 23:29:47,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=227, Unknown=0, NotChecked=0, Total=272 [2018-11-22 23:29:47,149 INFO L87 Difference]: Start difference. First operand 54 states and 66 transitions. cyclomatic complexity: 18 Second operand 17 states. [2018-11-22 23:29:47,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:47,380 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2018-11-22 23:29:47,381 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-22 23:29:47,381 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 87 states and 114 transitions. [2018-11-22 23:29:47,383 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 10 [2018-11-22 23:29:47,385 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 87 states to 86 states and 113 transitions. [2018-11-22 23:29:47,385 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-22 23:29:47,386 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 51 [2018-11-22 23:29:47,386 INFO L73 IsDeterministic]: Start isDeterministic. Operand 86 states and 113 transitions. [2018-11-22 23:29:47,386 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:47,386 INFO L705 BuchiCegarLoop]: Abstraction has 86 states and 113 transitions. [2018-11-22 23:29:47,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states and 113 transitions. [2018-11-22 23:29:47,391 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 65. [2018-11-22 23:29:47,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65 states. [2018-11-22 23:29:47,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 81 transitions. [2018-11-22 23:29:47,392 INFO L728 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-22 23:29:47,392 INFO L608 BuchiCegarLoop]: Abstraction has 65 states and 81 transitions. [2018-11-22 23:29:47,392 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-22 23:29:47,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 65 states and 81 transitions. [2018-11-22 23:29:47,393 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 8 [2018-11-22 23:29:47,393 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:47,393 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:47,394 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:47,394 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:29:47,394 INFO L794 eck$LassoCheckResult]: Stem: 901#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 898#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 899#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 900#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 864#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 865#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 921#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 911#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 927#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 926#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 870#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 909#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 869#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 909#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 869#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 871#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 922#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 887#gFINAL assume true; 888#gEXIT >#59#return; 891#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 919#gFINAL assume true; 918#gEXIT >#59#return; 880#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 883#gFINAL assume true; 917#gEXIT >#59#return; 915#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 913#gFINAL assume true; 912#gEXIT >#53#return; 873#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 906#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 907#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 867#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 868#gENTRY [2018-11-22 23:29:47,394 INFO L796 eck$LassoCheckResult]: Loop: 868#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 928#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 866#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 868#gENTRY [2018-11-22 23:29:47,394 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:47,394 INFO L82 PathProgramCache]: Analyzing trace with hash -812610185, now seen corresponding path program 3 times [2018-11-22 23:29:47,395 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:47,395 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,395 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:47,395 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:47,427 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 3 times [2018-11-22 23:29:47,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:47,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:47,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,432 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:47,432 INFO L82 PathProgramCache]: Analyzing trace with hash -2034316097, now seen corresponding path program 4 times [2018-11-22 23:29:47,432 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:47,432 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,433 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:47,433 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:47,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:47,739 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-22 23:29:47,998 WARN L180 SmtUtils]: Spent 157.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-22 23:29:48,301 WARN L180 SmtUtils]: Spent 171.00 ms on a formula simplification. DAG size of input: 123 DAG size of output: 115 [2018-11-22 23:29:48,792 WARN L180 SmtUtils]: Spent 221.00 ms on a formula simplification. DAG size of input: 139 DAG size of output: 128 [2018-11-22 23:29:49,090 WARN L180 SmtUtils]: Spent 207.00 ms on a formula simplification. DAG size of input: 121 DAG size of output: 120 [2018-11-22 23:29:49,258 WARN L180 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 84 [2018-11-22 23:29:49,818 WARN L180 SmtUtils]: Spent 407.00 ms on a formula simplification. DAG size of input: 145 DAG size of output: 144 [2018-11-22 23:29:49,974 WARN L180 SmtUtils]: Spent 152.00 ms on a formula simplification that was a NOOP. DAG size: 110 [2018-11-22 23:29:49,977 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:29:49,977 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:29:49,977 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:29:49,977 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:29:49,977 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:29:49,977 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:29:49,977 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:29:49,977 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:29:49,977 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration6_Lasso [2018-11-22 23:29:49,977 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:29:49,977 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:29:49,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,983 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,985 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,986 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,988 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,990 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,993 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,998 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:49,999 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,000 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,001 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,003 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,128 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,129 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,130 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,132 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,134 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,135 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,136 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,139 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,141 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,142 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,143 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,144 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,146 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,147 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,149 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,151 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,155 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,169 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,170 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,172 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:50,338 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:29:50,338 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:29:50,339 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,339 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,339 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,339 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,340 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,341 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,341 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,342 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,342 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,342 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,342 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,342 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,343 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,343 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,344 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,344 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,344 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,344 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,344 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,344 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,345 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,345 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,345 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,346 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,346 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,346 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,346 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,346 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,347 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,347 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,347 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,347 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,347 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,347 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,348 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,348 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,348 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,349 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,349 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,349 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,349 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,349 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,349 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,349 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,350 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,350 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,350 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,350 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,350 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,350 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,350 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,351 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,351 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,351 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,351 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,352 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,352 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,352 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,353 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,353 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,353 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,353 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,353 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,353 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,354 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,354 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,355 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,355 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,355 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,355 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,355 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,355 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,356 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,357 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,357 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,358 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,358 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,359 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,359 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,360 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,361 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,361 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,362 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,362 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,362 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,362 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,362 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,363 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,363 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,363 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,364 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,364 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,365 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,365 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,365 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,366 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,366 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,366 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:50,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,367 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,367 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:50,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:50,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,368 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,368 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,368 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,368 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,369 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:50,369 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,371 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,371 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,371 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,371 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,371 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,372 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,372 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,372 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,373 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,374 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,374 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,374 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,374 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,375 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,375 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,376 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,376 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,376 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,377 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,377 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:50,377 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,381 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,381 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,381 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,382 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,382 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,382 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,384 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,384 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,384 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,385 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,385 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,386 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,386 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,386 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,387 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,387 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,388 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,389 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,389 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,389 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,389 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,391 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,391 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,391 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,392 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,392 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,394 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,394 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,394 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:50,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,395 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,395 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:50,395 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,397 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:50,398 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,404 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,404 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,405 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:50,405 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:50,406 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:50,406 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:50,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:50,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:50,406 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:50,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:50,407 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:50,412 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:29:50,415 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2018-11-22 23:29:50,415 INFO L444 ModelExtractionUtils]: 7 out of 10 variables were initially zero. Simplification set additionally 0 variables to zero. [2018-11-22 23:29:50,416 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:29:50,416 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:29:50,416 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:29:50,416 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_2 + 1 Supporting invariants [] [2018-11-22 23:29:50,430 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 23:29:50,434 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:29:50,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:50,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,501 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,536 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,537 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 23:29:50,539 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,540 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 23:29:50,540 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,544 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,547 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,547 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 23:29:50,554 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:50,554 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 23:29:50,554 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-22 23:29:50,601 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 72 states and 88 transitions. Complement of second has 15 states. [2018-11-22 23:29:50,605 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:50,605 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:29:50,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-22 23:29:50,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 23:29:50,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:50,605 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 23:29:50,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:50,651 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,653 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,685 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,702 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,703 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 23:29:50,707 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,708 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 23:29:50,709 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,714 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,719 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,719 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 23:29:50,733 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:50,733 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and with honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 23:29:50,734 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-22 23:29:50,816 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 72 states and 88 transitions. Complement of second has 15 states. [2018-11-22 23:29:50,818 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:50,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:29:50,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 14 transitions. [2018-11-22 23:29:50,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 14 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 23:29:50,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:50,819 INFO L642 RefineBuchi]: Bad chosen interpolant automaton: word not accepted [2018-11-22 23:29:50,830 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:50,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,874 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:50,896 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:50,905 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,906 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 23:29:50,908 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:50,909 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 23:29:50,909 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,912 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,914 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:50,915 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 23:29:50,922 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:50,922 INFO L152 lantAutomatonBouncer]: Defining Buchi interpolant automaton with scrooge nondeterminism in stemwith honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 23:29:50,922 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22 Second operand 5 states. [2018-11-22 23:29:50,989 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 65 states and 81 transitions. cyclomatic complexity: 22. Second operand 5 states. Result 95 states and 114 transitions. Complement of second has 15 states. [2018-11-22 23:29:50,989 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:50,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:29:50,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 35 transitions. [2018-11-22 23:29:50,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 23:29:50,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:50,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 37 letters. Loop has 3 letters. [2018-11-22 23:29:50,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:50,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 35 transitions. Stem has 34 letters. Loop has 6 letters. [2018-11-22 23:29:50,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:50,991 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 114 transitions. [2018-11-22 23:29:50,992 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:50,994 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 69 states and 87 transitions. [2018-11-22 23:29:50,994 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 35 [2018-11-22 23:29:50,994 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 35 [2018-11-22 23:29:50,994 INFO L73 IsDeterministic]: Start isDeterministic. Operand 69 states and 87 transitions. [2018-11-22 23:29:50,994 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:50,994 INFO L705 BuchiCegarLoop]: Abstraction has 69 states and 87 transitions. [2018-11-22 23:29:50,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states and 87 transitions. [2018-11-22 23:29:50,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 60. [2018-11-22 23:29:50,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 60 states. [2018-11-22 23:29:50,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 73 transitions. [2018-11-22 23:29:50,998 INFO L728 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-22 23:29:50,998 INFO L608 BuchiCegarLoop]: Abstraction has 60 states and 73 transitions. [2018-11-22 23:29:50,998 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-22 23:29:50,998 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 60 states and 73 transitions. [2018-11-22 23:29:50,999 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:50,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:50,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:51,000 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:51,000 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-22 23:29:51,000 INFO L794 eck$LassoCheckResult]: Stem: 1626#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1623#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 1624#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 1625#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 1592#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 1593#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1630#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1608#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1628#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1629#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1601#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1602#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1650#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1600#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1602#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1651#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1614#gFINAL assume true; 1615#gEXIT >#59#return; 1611#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1612#gFINAL assume true; 1649#gEXIT >#59#return; 1607#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1610#gFINAL assume true; 1613#gEXIT >#53#return; 1618#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1634#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1647#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 1644#fFINAL assume true; 1640#fEXIT >#55#return; 1619#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 1599#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 1597#gENTRY [2018-11-22 23:29:51,000 INFO L796 eck$LassoCheckResult]: Loop: 1597#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1627#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1598#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1597#gENTRY [2018-11-22 23:29:51,000 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:51,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1299014260, now seen corresponding path program 1 times [2018-11-22 23:29:51,000 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:51,001 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,001 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:51,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:51,028 INFO L82 PathProgramCache]: Analyzing trace with hash 54773, now seen corresponding path program 4 times [2018-11-22 23:29:51,028 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:51,028 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:51,028 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,028 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:51,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:51,033 INFO L82 PathProgramCache]: Analyzing trace with hash 1278507682, now seen corresponding path program 2 times [2018-11-22 23:29:51,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:51,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:51,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,034 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:51,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:51,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:51,418 WARN L180 SmtUtils]: Spent 154.00 ms on a formula simplification. DAG size of input: 100 DAG size of output: 94 [2018-11-22 23:29:51,712 WARN L180 SmtUtils]: Spent 155.00 ms on a formula simplification. DAG size of input: 115 DAG size of output: 107 [2018-11-22 23:29:52,799 WARN L180 SmtUtils]: Spent 891.00 ms on a formula simplification. DAG size of input: 215 DAG size of output: 199 [2018-11-22 23:29:52,941 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 119 [2018-11-22 23:29:53,086 WARN L180 SmtUtils]: Spent 138.00 ms on a formula simplification that was a NOOP. DAG size: 125 [2018-11-22 23:29:53,306 WARN L180 SmtUtils]: Spent 122.00 ms on a formula simplification. DAG size of input: 102 DAG size of output: 87 [2018-11-22 23:29:53,471 WARN L180 SmtUtils]: Spent 117.00 ms on a formula simplification that was a NOOP. DAG size: 98 [2018-11-22 23:29:54,263 WARN L180 SmtUtils]: Spent 691.00 ms on a formula simplification. DAG size of input: 159 DAG size of output: 158 [2018-11-22 23:29:54,531 WARN L180 SmtUtils]: Spent 265.00 ms on a formula simplification that was a NOOP. DAG size: 126 [2018-11-22 23:29:54,534 INFO L216 LassoAnalysis]: Preferences: [2018-11-22 23:29:54,534 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-22 23:29:54,534 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-22 23:29:54,534 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-22 23:29:54,534 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-22 23:29:54,534 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-22 23:29:54,534 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-22 23:29:54,534 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-22 23:29:54,534 INFO L131 ssoRankerPreferences]: Filename of dumped script: rec_malloc_ex5B_true-termination.c.i_Iteration7_Lasso [2018-11-22 23:29:54,534 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-22 23:29:54,535 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-22 23:29:54,538 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,539 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,731 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,732 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,733 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,734 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,735 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,736 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,738 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,740 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,745 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,747 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,748 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,749 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,750 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,751 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,752 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,753 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,754 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,755 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,756 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,757 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,759 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,760 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,761 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,762 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,763 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,764 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,765 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,766 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,767 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,768 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,769 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,770 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,771 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,772 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,773 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,774 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,775 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,776 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,778 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,779 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,780 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,782 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,783 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,784 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,785 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,786 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,788 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,791 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,797 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-22 23:29:54,990 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-22 23:29:54,990 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-22 23:29:54,990 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:54,991 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:54,991 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-22 23:29:54,991 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:54,991 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:54,991 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:54,991 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-22 23:29:54,992 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-22 23:29:54,992 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:54,992 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:54,992 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:54,992 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:54,993 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:54,993 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:54,993 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:54,993 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:54,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:54,998 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:54,998 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:54,999 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:54,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:54,999 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:54,999 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:54,999 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,001 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,001 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,001 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,001 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,001 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,003 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,003 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,003 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,003 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,004 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,004 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,006 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,006 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,006 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,007 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,007 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,007 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,007 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,007 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,011 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,011 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,011 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,012 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,012 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,013 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,013 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,013 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,014 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,014 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,015 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,015 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,015 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:55,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,015 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,015 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:55,016 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,017 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,017 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:55,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,017 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,018 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:55,018 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,019 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,019 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,019 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,019 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,020 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,020 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,020 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,021 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,021 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,021 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,021 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:55,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,022 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,022 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:55,022 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,024 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,024 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,024 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,025 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:55,025 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,025 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,025 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:55,025 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,027 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,027 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-22 23:29:55,027 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,027 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,027 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-22 23:29:55,028 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,029 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-22 23:29:55,029 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-22 23:29:55,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-22 23:29:55,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-22 23:29:55,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-22 23:29:55,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-22 23:29:55,030 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-22 23:29:55,030 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-22 23:29:55,036 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-22 23:29:55,042 INFO L443 ModelExtractionUtils]: Simplification made 5 calls to the SMT solver. [2018-11-22 23:29:55,042 INFO L444 ModelExtractionUtils]: 3 out of 10 variables were initially zero. Simplification set additionally 4 variables to zero. [2018-11-22 23:29:55,043 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-22 23:29:55,043 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-22 23:29:55,043 INFO L518 LassoAnalysis]: Proved termination. [2018-11-22 23:29:55,043 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_3) = 2*v_rep(select (select #memory_int g_#in~p.base) g_#in~p.offset)_3 + 1 Supporting invariants [] [2018-11-22 23:29:55,074 INFO L297 tatePredicateManager]: 1 out of 1 supporting invariants were superfluous and have been removed [2018-11-22 23:29:55,090 WARN L1272 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-22 23:29:55,129 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:55,173 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:55,190 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:55,191 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:55,199 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:55,200 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 37 [2018-11-22 23:29:55,202 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:55,203 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 26 [2018-11-22 23:29:55,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,206 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,208 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,208 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:36, output treesize:21 [2018-11-22 23:29:55,215 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-22 23:29:55,215 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.2 stem predicates 3 loop predicates [2018-11-22 23:29:55,215 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 60 states and 73 transitions. cyclomatic complexity: 18 Second operand 5 states. [2018-11-22 23:29:55,278 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 60 states and 73 transitions. cyclomatic complexity: 18. Second operand 5 states. Result 84 states and 106 transitions. Complement of second has 18 states. [2018-11-22 23:29:55,279 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 6 states 2 stem states 3 non-accepting loop states 1 accepting loop states [2018-11-22 23:29:55,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2018-11-22 23:29:55,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 28 transitions. [2018-11-22 23:29:55,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 31 letters. Loop has 3 letters. [2018-11-22 23:29:55,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:55,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 34 letters. Loop has 3 letters. [2018-11-22 23:29:55,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:55,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 6 states and 28 transitions. Stem has 31 letters. Loop has 6 letters. [2018-11-22 23:29:55,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-22 23:29:55,281 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 106 transitions. [2018-11-22 23:29:55,282 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,284 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 78 states and 100 transitions. [2018-11-22 23:29:55,284 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 46 [2018-11-22 23:29:55,284 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 48 [2018-11-22 23:29:55,284 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 100 transitions. [2018-11-22 23:29:55,284 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:55,284 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 100 transitions. [2018-11-22 23:29:55,285 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 100 transitions. [2018-11-22 23:29:55,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2018-11-22 23:29:55,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-22 23:29:55,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 96 transitions. [2018-11-22 23:29:55,289 INFO L728 BuchiCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-11-22 23:29:55,289 INFO L608 BuchiCegarLoop]: Abstraction has 76 states and 96 transitions. [2018-11-22 23:29:55,289 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-22 23:29:55,290 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 96 transitions. [2018-11-22 23:29:55,290 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,290 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:55,290 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:55,291 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [4, 4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:55,291 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:29:55,291 INFO L794 eck$LassoCheckResult]: Stem: 1922#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 1919#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 1920#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 1921#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 1884#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 1885#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1918#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 1901#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 1932#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1956#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1893#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1894#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1926#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 1892#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 1894#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1927#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1908#gFINAL assume true; 1909#gEXIT >#59#return; 1914#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1957#gFINAL assume true; 1955#gEXIT >#59#return; 1899#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 1902#gFINAL assume true; 1907#gEXIT >#53#return; 1912#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 1928#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 1929#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 1959#fFINAL assume true; 1958#fEXIT >#55#return; 1915#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 1886#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 1887#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 1925#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 1947#gFINAL assume true; 1942#gEXIT >#57#return; 1941#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 1934#L36-3 [2018-11-22 23:29:55,292 INFO L796 eck$LassoCheckResult]: Loop: 1934#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 1933#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 1934#L36-3 [2018-11-22 23:29:55,292 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,292 INFO L82 PathProgramCache]: Analyzing trace with hash 285182745, now seen corresponding path program 1 times [2018-11-22 23:29:55,292 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:55,292 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:55,292 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,292 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:55,293 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:55,367 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2018-11-22 23:29:55,367 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-22 23:29:55,367 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2018-11-22 23:29:55,368 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:29:55,368 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,368 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 1 times [2018-11-22 23:29:55,368 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:55,368 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,368 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:55,368 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:55,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:55,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-22 23:29:55,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2018-11-22 23:29:55,380 INFO L87 Difference]: Start difference. First operand 76 states and 96 transitions. cyclomatic complexity: 26 Second operand 7 states. [2018-11-22 23:29:55,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:55,415 INFO L93 Difference]: Finished difference Result 78 states and 96 transitions. [2018-11-22 23:29:55,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-22 23:29:55,415 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 96 transitions. [2018-11-22 23:29:55,417 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,418 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 75 states and 93 transitions. [2018-11-22 23:29:55,418 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 47 [2018-11-22 23:29:55,418 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 47 [2018-11-22 23:29:55,418 INFO L73 IsDeterministic]: Start isDeterministic. Operand 75 states and 93 transitions. [2018-11-22 23:29:55,418 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:55,419 INFO L705 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-22 23:29:55,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states and 93 transitions. [2018-11-22 23:29:55,423 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 75. [2018-11-22 23:29:55,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-11-22 23:29:55,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 93 transitions. [2018-11-22 23:29:55,424 INFO L728 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-22 23:29:55,424 INFO L608 BuchiCegarLoop]: Abstraction has 75 states and 93 transitions. [2018-11-22 23:29:55,424 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-22 23:29:55,424 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 75 states and 93 transitions. [2018-11-22 23:29:55,425 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,425 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:55,425 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:55,426 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [5, 5, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:55,426 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:29:55,426 INFO L794 eck$LassoCheckResult]: Stem: 2087#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2084#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2085#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2086#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2050#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2051#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2083#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2067#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2096#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2118#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2057#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2058#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2090#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2056#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2058#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2091#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2074#gFINAL assume true; 2075#gEXIT >#59#return; 2069#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2070#gFINAL assume true; 2120#gEXIT >#59#return; 2065#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2068#gFINAL assume true; 2073#gEXIT >#53#return; 2078#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2092#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2093#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2124#fFINAL assume true; 2123#fEXIT >#55#return; 2080#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2059#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2060#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2089#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2099#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2105#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2098#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2100#gFINAL assume true; 2122#gEXIT >#59#return; 2108#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2109#gFINAL assume true; 2107#gEXIT >#57#return; 2071#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2072#L36-3 [2018-11-22 23:29:55,426 INFO L796 eck$LassoCheckResult]: Loop: 2072#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2097#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2072#L36-3 [2018-11-22 23:29:55,426 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,427 INFO L82 PathProgramCache]: Analyzing trace with hash 1887283889, now seen corresponding path program 2 times [2018-11-22 23:29:55,427 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:55,427 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,427 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:55,427 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:55,509 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 3 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-11-22 23:29:55,509 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:29:55,509 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:29:55,524 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST1 [2018-11-22 23:29:55,570 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2018-11-22 23:29:55,570 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:29:55,573 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:55,608 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-22 23:29:55,609 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-22 23:29:55,610 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,611 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,611 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,612 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-22 23:29:55,626 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-22 23:29:55,627 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 23:29:55,628 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,640 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-22 23:29:55,642 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-22 23:29:55,643 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:55,655 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:55,660 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 33 [2018-11-22 23:29:55,660 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-22 23:29:55,672 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:29:55,678 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:29:55,687 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 23:29:55,687 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:30 [2018-11-22 23:29:55,743 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 28 proven. 5 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2018-11-22 23:29:55,758 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:29:55,758 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 13] total 17 [2018-11-22 23:29:55,758 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:29:55,758 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,758 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 2 times [2018-11-22 23:29:55,758 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:55,759 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,759 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:55,759 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:55,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:55,774 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-22 23:29:55,774 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=231, Unknown=0, NotChecked=0, Total=272 [2018-11-22 23:29:55,774 INFO L87 Difference]: Start difference. First operand 75 states and 93 transitions. cyclomatic complexity: 24 Second operand 17 states. [2018-11-22 23:29:55,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:55,976 INFO L93 Difference]: Finished difference Result 78 states and 97 transitions. [2018-11-22 23:29:55,977 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-22 23:29:55,977 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 97 transitions. [2018-11-22 23:29:55,978 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,979 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 78 states and 97 transitions. [2018-11-22 23:29:55,979 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2018-11-22 23:29:55,980 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2018-11-22 23:29:55,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 78 states and 97 transitions. [2018-11-22 23:29:55,980 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:55,980 INFO L705 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-22 23:29:55,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states and 97 transitions. [2018-11-22 23:29:55,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2018-11-22 23:29:55,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 78 states. [2018-11-22 23:29:55,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 97 transitions. [2018-11-22 23:29:55,985 INFO L728 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-22 23:29:55,985 INFO L608 BuchiCegarLoop]: Abstraction has 78 states and 97 transitions. [2018-11-22 23:29:55,985 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-22 23:29:55,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 97 transitions. [2018-11-22 23:29:55,986 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:55,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:55,986 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:55,987 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [6, 6, 4, 4, 4, 4, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:55,987 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:29:55,987 INFO L794 eck$LassoCheckResult]: Stem: 2402#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2399#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2400#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2401#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2364#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2365#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2397#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2398#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2409#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2434#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2375#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2376#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2404#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2374#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2376#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2405#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2438#gFINAL assume true; 2437#gEXIT >#59#return; 2436#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2435#gFINAL assume true; 2433#gEXIT >#59#return; 2431#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2429#gFINAL assume true; 2428#gEXIT >#53#return; 2427#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2413#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2432#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2430#fFINAL assume true; 2426#fEXIT >#55#return; 2394#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2381#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2369#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2403#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2380#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2419#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2403#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2380#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2419#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2414#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2387#gFINAL assume true; 2388#gEXIT >#59#return; 2379#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2382#gFINAL assume true; 2425#gEXIT >#59#return; 2422#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2423#gFINAL assume true; 2421#gEXIT >#57#return; 2420#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2411#L36-3 [2018-11-22 23:29:55,987 INFO L796 eck$LassoCheckResult]: Loop: 2411#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2410#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2411#L36-3 [2018-11-22 23:29:55,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:55,987 INFO L82 PathProgramCache]: Analyzing trace with hash 2114677145, now seen corresponding path program 3 times [2018-11-22 23:29:55,988 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:55,988 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:55,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:55,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:56,085 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 44 proven. 9 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2018-11-22 23:29:56,086 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:29:56,086 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:29:56,101 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-22 23:29:56,160 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-22 23:29:56,160 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-22 23:29:56,162 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:56,181 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 15 treesize of output 11 [2018-11-22 23:29:56,182 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 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 11 treesize of output 7 [2018-11-22 23:29:56,182 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:56,183 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:56,185 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:56,186 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:15, output treesize:3 [2018-11-22 23:29:56,201 INFO L478 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-22 23:29:56,202 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 23:29:56,203 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:56,216 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 33 [2018-11-22 23:29:56,218 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 21 [2018-11-22 23:29:56,218 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:56,236 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:56,240 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 33 [2018-11-22 23:29:56,240 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 2 xjuncts. [2018-11-22 23:29:56,252 INFO L267 ElimStorePlain]: Start of recursive call 4: 2 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:29:56,258 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:29:56,267 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-22 23:29:56,267 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:36, output treesize:30 [2018-11-22 23:29:56,343 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 44 proven. 11 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2018-11-22 23:29:56,358 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-22 23:29:56,358 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14] total 19 [2018-11-22 23:29:56,359 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-22 23:29:56,359 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:56,359 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 3 times [2018-11-22 23:29:56,359 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:56,359 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,360 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:56,360 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,372 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-22 23:29:56,373 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2018-11-22 23:29:56,373 INFO L87 Difference]: Start difference. First operand 78 states and 97 transitions. cyclomatic complexity: 25 Second operand 19 states. [2018-11-22 23:29:56,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-22 23:29:56,567 INFO L93 Difference]: Finished difference Result 84 states and 105 transitions. [2018-11-22 23:29:56,567 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-22 23:29:56,567 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 84 states and 105 transitions. [2018-11-22 23:29:56,568 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:56,569 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 84 states to 84 states and 105 transitions. [2018-11-22 23:29:56,570 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 53 [2018-11-22 23:29:56,570 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 53 [2018-11-22 23:29:56,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 84 states and 105 transitions. [2018-11-22 23:29:56,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2018-11-22 23:29:56,570 INFO L705 BuchiCegarLoop]: Abstraction has 84 states and 105 transitions. [2018-11-22 23:29:56,570 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states and 105 transitions. [2018-11-22 23:29:56,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 81. [2018-11-22 23:29:56,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-22 23:29:56,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 101 transitions. [2018-11-22 23:29:56,575 INFO L728 BuchiCegarLoop]: Abstraction has 81 states and 101 transitions. [2018-11-22 23:29:56,575 INFO L608 BuchiCegarLoop]: Abstraction has 81 states and 101 transitions. [2018-11-22 23:29:56,575 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-22 23:29:56,575 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 81 states and 101 transitions. [2018-11-22 23:29:56,576 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 7 [2018-11-22 23:29:56,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-22 23:29:56,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-22 23:29:56,577 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [7, 7, 5, 5, 5, 5, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-22 23:29:56,577 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-22 23:29:56,577 INFO L794 eck$LassoCheckResult]: Stem: 2745#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 2742#L-1 havoc main_#res;havoc main_#t~malloc14.base, main_#t~malloc14.offset, main_#t~malloc15.base, main_#t~malloc15.offset, main_#t~nondet16, main_#t~nondet17, main_#t~mem18, main_#t~mem19, main_#t~short20, main_#t~mem21, main_#t~ret22.base, main_#t~ret22.offset, main_~p1~0.base, main_~p1~0.offset, main_~p2~0.base, main_~p2~0.offset;call main_#t~malloc14.base, main_#t~malloc14.offset := #Ultimate.alloc(4);main_~p1~0.base, main_~p1~0.offset := main_#t~malloc14.base, main_#t~malloc14.offset;call main_#t~malloc15.base, main_#t~malloc15.offset := #Ultimate.alloc(4);main_~p2~0.base, main_~p2~0.offset := main_#t~malloc15.base, main_#t~malloc15.offset;call write~int(main_#t~nondet16, main_~p1~0.base, main_~p1~0.offset, 4);havoc main_#t~nondet16;call write~int(main_#t~nondet17, main_~p2~0.base, main_~p2~0.offset, 4);havoc main_#t~nondet17;call main_#t~mem18 := read~int(main_~p1~0.base, main_~p1~0.offset, 4);main_#t~short20 := main_#t~mem18 < 0; 2743#L76 assume !main_#t~short20;call main_#t~mem19 := read~int(main_~p2~0.base, main_~p2~0.offset, 4);main_#t~short20 := main_#t~mem19 < 0; 2744#L76-2 assume !main_#t~short20;havoc main_#t~mem18;havoc main_#t~mem19;havoc main_#t~short20;call main_#t~mem21 := read~int(main_~p2~0.base, main_~p2~0.offset, 4); 2707#L79 call main_#t~ret22.base, main_#t~ret22.offset := f(main_~p1~0.base, main_~p1~0.offset, main_#t~mem21);< 2708#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2740#L17 assume !(~v < 0);call #t~malloc2.base, #t~malloc2.offset := #Ultimate.alloc(4);~tmp~0.base, ~tmp~0.offset := #t~malloc2.base, #t~malloc2.offset;call write~int(1 + ~v, ~tmp~0.base, ~tmp~0.offset, 4); 2741#L25 call #t~ret3.base, #t~ret3.offset := g(~tmp~0.base, ~tmp~0.offset);< 2755#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2778#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2718#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2719#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2747#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2717#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2719#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2748#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2781#gFINAL assume true; 2734#gEXIT >#59#return; 2735#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2779#gFINAL assume true; 2776#gEXIT >#59#return; 2774#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2773#gFINAL assume true; 2772#gEXIT >#53#return; 2750#L25-1 call #t~ret4.base, #t~ret4.offset := f(#t~ret3.base, #t~ret3.offset, ~v - 1);< 2749#fENTRY ~q.base, ~q.offset := #in~q.base, #in~q.offset;~v := #in~v; 2752#L17 assume ~v < 0;call ULTIMATE.dealloc(~q.base, ~q.offset);call #t~malloc1.base, #t~malloc1.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc1.base, #t~malloc1.offset; 2780#fFINAL assume true; 2769#fEXIT >#55#return; 2767#L25-2 ~tmp2~0.base, ~tmp2~0.offset := #t~ret4.base, #t~ret4.offset;havoc #t~ret4.base, #t~ret4.offset;havoc #t~ret3.base, #t~ret3.offset;call write~int(0, ~tmp2~0.base, ~tmp2~0.offset, 4);call #t~malloc5.base, #t~malloc5.offset := #Ultimate.alloc(4);~tmp3~0.base, ~tmp3~0.offset := #t~malloc5.base, #t~malloc5.offset;call write~int(2 + ~v, ~tmp3~0.base, ~tmp3~0.offset, 4); 2725#L32 call #t~ret6.base, #t~ret6.offset := g(~tmp3~0.base, ~tmp3~0.offset);< 2766#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2762#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2724#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2761#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2762#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2724#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2761#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2762#L47 assume !(#t~mem8 < 0);havoc #t~mem8;call #t~mem10 := read~int(~p.base, ~p.offset, 4);#t~post11 := #t~mem10;call write~int(#t~post11 - 1, ~p.base, ~p.offset, 4);havoc #t~mem10;havoc #t~post11; 2724#L55 call #t~ret12.base, #t~ret12.offset := g(~p.base, ~p.offset);< 2761#gENTRY ~p.base, ~p.offset := #in~p.base, #in~p.offset;call #t~mem8 := read~int(~p.base, ~p.offset, 4); 2757#L47 assume #t~mem8 < 0;havoc #t~mem8;call ULTIMATE.dealloc(~p.base, ~p.offset);call #t~malloc9.base, #t~malloc9.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc9.base, #t~malloc9.offset; 2729#gFINAL assume true; 2730#gEXIT >#59#return; 2722#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2726#gFINAL assume true; 2786#gEXIT >#59#return; 2785#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2784#gFINAL assume true; 2783#gEXIT >#59#return; 2765#L55-1 ~np~0.base, ~np~0.offset := #t~ret12.base, #t~ret12.offset;havoc #t~ret12.base, #t~ret12.offset;call ULTIMATE.dealloc(~np~0.base, ~np~0.offset);call #t~malloc13.base, #t~malloc13.offset := #Ultimate.alloc(4);#res.base, #res.offset := #t~malloc13.base, #t~malloc13.offset; 2782#gFINAL assume true; 2764#gEXIT >#57#return; 2720#L32-1 ~tmp4~0.base, ~tmp4~0.offset := #t~ret6.base, #t~ret6.offset;havoc #t~ret6.base, #t~ret6.offset;call write~int(1, ~tmp4~0.base, ~tmp4~0.offset, 4); 2721#L36-3 [2018-11-22 23:29:56,577 INFO L796 eck$LassoCheckResult]: Loop: 2721#L36-3 call #t~mem7 := read~int(~tmp2~0.base, ~tmp2~0.offset, 4); 2756#L36-1 assume !!(0 != #t~mem7);havoc #t~mem7; 2721#L36-3 [2018-11-22 23:29:56,577 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:56,577 INFO L82 PathProgramCache]: Analyzing trace with hash 1644390193, now seen corresponding path program 4 times [2018-11-22 23:29:56,577 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:56,578 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,578 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:56,578 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,616 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:56,616 INFO L82 PathProgramCache]: Analyzing trace with hash 1414, now seen corresponding path program 4 times [2018-11-22 23:29:56,616 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:56,616 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,617 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:56,617 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-22 23:29:56,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-22 23:29:56,619 INFO L82 PathProgramCache]: Analyzing trace with hash -288989002, now seen corresponding path program 1 times [2018-11-22 23:29:56,619 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-22 23:29:56,619 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-22 23:29:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-22 23:29:56,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-22 23:29:56,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:58,409 WARN L180 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 58 DAG size of output: 52 [2018-11-22 23:29:58,708 WARN L180 SmtUtils]: Spent 219.00 ms on a formula simplification. DAG size of input: 80 DAG size of output: 68 [2018-11-22 23:29:59,073 WARN L180 SmtUtils]: Spent 210.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 68 [2018-11-22 23:29:59,211 INFO L134 CoverageAnalysis]: Checked inductivity of 106 backedges. 60 proven. 15 refuted. 0 times theorem prover too weak. 31 trivial. 0 not checked. [2018-11-22 23:29:59,211 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-22 23:29:59,211 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_8324082b-9325-4139-b6b6-4a61c8aae5e0/bin-2019/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-22 23:29:59,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-22 23:29:59,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-22 23:29:59,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-22 23:29:59,274 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2018-11-22 23:29:59,277 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:59,285 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 2 case distinctions, treesize of input 12 treesize of output 15 [2018-11-22 23:29:59,285 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-22 23:29:59,294 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-22 23:29:59,302 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-22 23:29:59,302 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:13, output treesize:24 [2018-11-22 23:29:59,310 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:59,330 INFO L701 Elim1Store]: detected not equals via solver [2018-11-22 23:29:59,330 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 21 [2018-11-22 23:29:59,331 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 22 [2018-11-22 23:29:59,348 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2018-11-22 23:29:59,348 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,360 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 22 [2018-11-22 23:29:59,362 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 9 [2018-11-22 23:29:59,362 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,366 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,369 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,376 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-1 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-22 23:29:59,376 INFO L202 ElimStorePlain]: Needed 6 recursive calls to eliminate 4 variables, input treesize:49, output treesize:25 [2018-11-22 23:30:36,234 WARN L180 SmtUtils]: Spent 12.13 s on a formula simplification that was a NOOP. DAG size: 18 [2018-11-22 23:30:48,389 WARN L180 SmtUtils]: Spent 12.09 s on a formula simplification that was a NOOP. DAG size: 23 [2018-11-22 23:32:02,568 WARN L180 SmtUtils]: Spent 12.02 s on a formula simplification that was a NOOP. DAG size: 29 [2018-11-22 23:32:37,374 WARN L194 Executor]: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000) stderr output: (error "out of memory") [2018-11-22 23:32:37,375 FATAL L265 ToolchainWalker]: An unrecoverable error occured during an interaction with an SMT solver: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parseCheckSatResult(Executor.java:225) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Scriptor.checkSat(Scriptor.java:155) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.WrapperScript.checkSat(WrapperScript.java:116) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.managedscript.ManagedScript.checkSat(ManagedScript.java:141) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.MonolithicImplicationChecker.checkImplication(MonolithicImplicationChecker.java:84) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.compare(PredicateUnifier.java:928) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier$PredicateComparison.(PredicateUnifier.java:767) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:339) at de.uni_freiburg.informatik.ultimate.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate(PredicateUnifier.java:299) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp$UnifyPostprocessor.postprocess(TraceCheckSpWp.java:575) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:439) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:200) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:286) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:175) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:162) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructForwardBackward(TraceCheckConstructor.java:224) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.constructTraceCheck(TraceCheckConstructor.java:188) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceCheckConstructor.get(TraceCheckConstructor.java:165) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.MultiTrackRefinementStrategy.getTraceCheck(MultiTrackRefinementStrategy.java:232) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.checkFeasibility(BaseRefinementStrategy.java:223) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.BaseRefinementStrategy.executeStrategy(BaseRefinementStrategy.java:197) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:70) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkFeasibilityAndComputeInterpolants(LassoCheck.java:929) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.checkConcatFeasibility(LassoCheck.java:899) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck$LassoCheckResult.(LassoCheck.java:832) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.LassoCheck.(LassoCheck.java:251) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiCegarLoop.iterate(BuchiCegarLoop.java:476) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.doTerminationAnalysis(BuchiAutomizerObserver.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver.finish(BuchiAutomizerObserver.java:384) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:316) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:55) Caused by: de.uni_freiburg.informatik.ultimate.logic.SMTLIBException: EOF at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser$Action$.CUP$do_action(Parser.java:1427) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Parser.do_action(Parser.java:630) at com.github.jhoenicke.javacup.runtime.LRParser.parse(LRParser.java:419) at de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:205) ... 39 more [2018-11-22 23:32:37,377 INFO L168 Benchmark]: Toolchain (without parser) took 175722.87 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 536.3 MB). Free memory was 959.1 MB in the beginning and 880.5 MB in the end (delta: 78.6 MB). Peak memory consumption was 615.0 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,377 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-22 23:32:37,377 INFO L168 Benchmark]: CACSL2BoogieTranslator took 162.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,378 INFO L168 Benchmark]: Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,378 INFO L168 Benchmark]: Boogie Preprocessor took 49.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,379 INFO L168 Benchmark]: RCFGBuilder took 214.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,379 INFO L168 Benchmark]: BuchiAutomizer took 175270.60 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 381.2 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 248.5 MB). Peak memory consumption was 629.6 MB. Max. memory is 11.5 GB. [2018-11-22 23:32:37,381 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.4 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 162.61 ms. Allocated memory is still 1.0 GB. Free memory was 959.1 MB in the beginning and 948.2 MB in the end (delta: 10.9 MB). Peak memory consumption was 10.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 23.00 ms. Allocated memory is still 1.0 GB. Free memory was 948.2 MB in the beginning and 945.5 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 49.71 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 155.2 MB). Free memory was 945.5 MB in the beginning and 1.2 GB in the end (delta: -204.5 MB). Peak memory consumption was 14.5 MB. Max. memory is 11.5 GB. * RCFGBuilder took 214.21 ms. Allocated memory is still 1.2 GB. Free memory was 1.2 GB in the beginning and 1.1 GB in the end (delta: 21.1 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 175270.60 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 381.2 MB). Free memory was 1.1 GB in the beginning and 880.5 MB in the end (delta: 248.5 MB). Peak memory consumption was 629.6 MB. 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 * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: - ExceptionOrErrorResult: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer: SMTLIBException: External (z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000)Received EOF on stdin. stderr output: (error "out of memory") : de.uni_freiburg.informatik.ultimate.smtsolver.external.Executor.parse(Executor.java:208) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request...