./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-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_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i -s /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/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 29a51818b617f99bc080ce25bd5bb0f6016d86c9 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 00:11:54,275 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 00:11:54,277 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 00:11:54,284 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 00:11:54,284 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 00:11:54,285 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 00:11:54,286 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 00:11:54,287 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 00:11:54,288 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 00:11:54,289 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 00:11:54,290 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 00:11:54,290 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 00:11:54,291 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 00:11:54,291 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 00:11:54,292 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 00:11:54,292 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 00:11:54,293 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 00:11:54,294 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 00:11:54,296 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 00:11:54,297 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 00:11:54,297 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 00:11:54,298 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 00:11:54,300 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 00:11:54,300 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 00:11:54,300 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 00:11:54,301 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 00:11:54,302 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 00:11:54,302 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 00:11:54,303 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 00:11:54,303 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 00:11:54,304 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 00:11:54,304 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 00:11:54,304 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 00:11:54,305 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 00:11:54,305 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 00:11:54,306 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 00:11:54,306 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/config/svcomp-Termination-64bit-Automizer_Default.epf [2018-11-23 00:11:54,316 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 00:11:54,316 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 00:11:54,317 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-23 00:11:54,317 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-23 00:11:54,317 INFO L133 SettingsManager]: * Use SBE=true [2018-11-23 00:11:54,317 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-23 00:11:54,317 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-23 00:11:54,318 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-23 00:11:54,318 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-23 00:11:54,318 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-23 00:11:54,318 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-23 00:11:54,318 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 00:11:54,318 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 00:11:54,319 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-23 00:11:54,320 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 00:11:54,320 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-23 00:11:54,320 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 00:11:54,320 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 00:11:54,320 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-23 00:11:54,320 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 00:11:54,320 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-23 00:11:54,321 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-23 00:11:54,321 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-23 00:11:54,322 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_b44f7c53-cbc2-400a-959f-e7ca5707ad95/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 -> 29a51818b617f99bc080ce25bd5bb0f6016d86c9 [2018-11-23 00:11:54,347 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 00:11:54,358 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 00:11:54,361 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 00:11:54,363 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 00:11:54,363 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 00:11:54,363 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/../../sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i [2018-11-23 00:11:54,412 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/data/76317df55/581f9f2edab64756afd67fd35fd22fca/FLAG9c8b23636 [2018-11-23 00:11:54,818 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 00:11:54,818 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/sv-benchmarks/c/termination-memory-linkedlists/nondet_ll_search-alloca_false-termination.c.i [2018-11-23 00:11:54,828 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/data/76317df55/581f9f2edab64756afd67fd35fd22fca/FLAG9c8b23636 [2018-11-23 00:11:55,191 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/data/76317df55/581f9f2edab64756afd67fd35fd22fca [2018-11-23 00:11:55,193 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 00:11:55,195 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 00:11:55,196 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 00:11:55,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 00:11:55,200 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 00:11:55,201 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,203 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7befe0c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55, skipping insertion in model container [2018-11-23 00:11:55,203 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,210 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 00:11:55,244 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 00:11:55,460 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:11:55,470 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 00:11:55,557 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 00:11:55,596 INFO L195 MainTranslator]: Completed translation [2018-11-23 00:11:55,597 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55 WrapperNode [2018-11-23 00:11:55,597 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 00:11:55,598 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 00:11:55,598 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 00:11:55,598 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 00:11:55,604 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,613 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,627 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 00:11:55,627 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 00:11:55,627 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 00:11:55,627 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 00:11:55,634 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,634 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,636 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,636 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,644 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,645 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... [2018-11-23 00:11:55,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 00:11:55,647 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 00:11:55,647 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 00:11:55,647 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 00:11:55,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/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-23 00:11:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-11-23 00:11:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-11-23 00:11:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2018-11-23 00:11:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2018-11-23 00:11:55,689 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2018-11-23 00:11:55,690 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 00:11:55,690 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 00:11:55,882 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 00:11:55,882 INFO L280 CfgBuilder]: Removed 10 assue(true) statements. [2018-11-23 00:11:55,882 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:11:55 BoogieIcfgContainer [2018-11-23 00:11:55,882 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 00:11:55,883 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-23 00:11:55,883 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-23 00:11:55,885 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-23 00:11:55,886 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:11:55,886 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 23.11 12:11:55" (1/3) ... [2018-11-23 00:11:55,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b6635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:11:55, skipping insertion in model container [2018-11-23 00:11:55,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:11:55,887 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 12:11:55" (2/3) ... [2018-11-23 00:11:55,887 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@11b6635c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 23.11 12:11:55, skipping insertion in model container [2018-11-23 00:11:55,887 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-23 00:11:55,888 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:11:55" (3/3) ... [2018-11-23 00:11:55,889 INFO L375 chiAutomizerObserver]: Analyzing ICFG nondet_ll_search-alloca_false-termination.c.i [2018-11-23 00:11:55,929 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-23 00:11:55,930 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-23 00:11:55,930 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-23 00:11:55,930 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-23 00:11:55,930 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 00:11:55,931 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 00:11:55,931 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-23 00:11:55,931 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 00:11:55,931 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-23 00:11:55,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 00:11:55,957 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 00:11:55,958 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:11:55,958 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:11:55,965 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 00:11:55,965 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:11:55,965 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-23 00:11:55,965 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 14 states. [2018-11-23 00:11:55,966 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 5 [2018-11-23 00:11:55,966 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:11:55,966 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:11:55,967 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1] [2018-11-23 00:11:55,967 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1] [2018-11-23 00:11:55,975 INFO L794 eck$LassoCheckResult]: Stem: 10#ULTIMATE.startENTRYtrue #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 7#L-1true havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 16#L552-3true [2018-11-23 00:11:55,975 INFO L796 eck$LassoCheckResult]: Loop: 16#L552-3true assume !!(init_nondet_ll_~i~0 < init_nondet_ll_~n);call init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset := #Ultimate.alloc(12);init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset := init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset;call write~int(init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, 4);call write~$Pointer$(init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset; 14#L552-2true init_nondet_ll_#t~post3 := init_nondet_ll_~i~0;init_nondet_ll_~i~0 := 1 + init_nondet_ll_#t~post3;havoc init_nondet_ll_#t~post3; 16#L552-3true [2018-11-23 00:11:55,981 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:55,981 INFO L82 PathProgramCache]: Analyzing trace with hash 963, now seen corresponding path program 1 times [2018-11-23 00:11:55,983 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:55,984 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:56,023 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,024 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:56,024 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:56,087 INFO L82 PathProgramCache]: Analyzing trace with hash 1283, now seen corresponding path program 1 times [2018-11-23 00:11:56,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:56,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,088 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:56,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,112 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:56,112 INFO L82 PathProgramCache]: Analyzing trace with hash 925765, now seen corresponding path program 1 times [2018-11-23 00:11:56,112 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:56,112 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,113 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:56,113 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:56,129 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:56,351 WARN L180 SmtUtils]: Spent 196.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 80 [2018-11-23 00:11:56,378 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:56,386 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:56,459 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:56,471 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:56,543 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:56,544 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:153, output treesize:155 [2018-11-23 00:11:56,749 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:11:56,750 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:11:56,750 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:11:56,751 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:11:56,751 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:11:56,751 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:11:56,751 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:11:56,751 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:11:56,751 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_search-alloca_false-termination.c.i_Iteration1_Lasso [2018-11-23 00:11:56,752 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:11:56,752 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:11:56,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-23 00:11:56,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-23 00:11:56,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-23 00:11:56,789 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,795 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,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-23 00:11:56,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,801 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,803 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,808 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:56,810 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:57,010 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:57,240 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:11:57,243 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:11:57,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,246 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,249 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,252 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,252 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,253 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,253 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,254 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,259 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,259 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,263 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,264 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,265 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,266 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,266 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,266 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,266 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,266 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,269 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,269 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,270 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,270 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,270 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,271 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,271 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,272 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,272 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,272 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,272 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,273 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,274 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,280 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,285 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,287 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,291 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,291 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,291 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,291 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,294 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,295 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,295 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,301 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,302 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,302 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,309 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,309 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,311 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,311 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,328 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,329 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,333 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,334 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,334 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,334 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,334 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,337 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,337 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,338 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,339 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,339 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:11:57,339 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:11:57,340 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,347 INFO L402 nArgumentSynthesizer]: We have 20 Motzkin's Theorem applications. [2018-11-23 00:11:57,347 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:57,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,393 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,397 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,397 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,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-23 00:11:57,405 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,405 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,408 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,408 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,413 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,414 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:57,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,414 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,415 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:57,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:57,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:57,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:57,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:57,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:57,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:57,417 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:57,418 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:57,418 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:57,432 INFO L421 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2018-11-23 00:11:57,441 INFO L443 ModelExtractionUtils]: Simplification made 4 calls to the SMT solver. [2018-11-23 00:11:57,441 INFO L444 ModelExtractionUtils]: 12 out of 16 variables were initially zero. Simplification set additionally 1 variables to zero. [2018-11-23 00:11:57,443 INFO L437 nArgumentSynthesizer]: Simplifying supporting invariants... [2018-11-23 00:11:57,445 INFO L440 nArgumentSynthesizer]: Removed 2 redundant supporting invariants from a total of 2. [2018-11-23 00:11:57,445 INFO L518 LassoAnalysis]: Proved termination. [2018-11-23 00:11:57,446 INFO L520 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_init_nondet_ll_~n, ULTIMATE.start_init_nondet_ll_~i~0) = 1*ULTIMATE.start_init_nondet_ll_~n - 1*ULTIMATE.start_init_nondet_ll_~i~0 Supporting invariants [] [2018-11-23 00:11:57,472 INFO L297 tatePredicateManager]: 3 out of 3 supporting invariants were superfluous and have been removed [2018-11-23 00:11:57,494 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:57,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:11:57,511 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:11:57,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:11:57,526 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:11:57,541 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-23 00:11:57,552 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2018-11-23 00:11:57,553 INFO L72 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 14 states. Second operand 3 states. [2018-11-23 00:11:57,593 INFO L76 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 14 states.. Second operand 3 states. Result 36 states and 51 transitions. Complement of second has 7 states. [2018-11-23 00:11:57,594 INFO L142 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 5 states 1 stem states 2 non-accepting loop states 1 accepting loop states [2018-11-23 00:11:57,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2018-11-23 00:11:57,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 32 transitions. [2018-11-23 00:11:57,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 2 letters. Loop has 2 letters. [2018-11-23 00:11:57,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:11:57,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 4 letters. Loop has 2 letters. [2018-11-23 00:11:57,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:11:57,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 5 states and 32 transitions. Stem has 2 letters. Loop has 4 letters. [2018-11-23 00:11:57,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2018-11-23 00:11:57,601 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 36 states and 51 transitions. [2018-11-23 00:11:57,605 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:11:57,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 36 states to 11 states and 15 transitions. [2018-11-23 00:11:57,610 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 8 [2018-11-23 00:11:57,610 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 9 [2018-11-23 00:11:57,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 15 transitions. [2018-11-23 00:11:57,611 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:11:57,611 INFO L705 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 00:11:57,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11 states and 15 transitions. [2018-11-23 00:11:57,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11 to 11. [2018-11-23 00:11:57,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2018-11-23 00:11:57,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 15 transitions. [2018-11-23 00:11:57,639 INFO L728 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 00:11:57,639 INFO L608 BuchiCegarLoop]: Abstraction has 11 states and 15 transitions. [2018-11-23 00:11:57,639 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-23 00:11:57,639 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 11 states and 15 transitions. [2018-11-23 00:11:57,640 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:11:57,640 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:11:57,640 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:11:57,640 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:11:57,641 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:11:57,641 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 104#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 101#L552-4 assume !(0 != init_nondet_ll_#t~nondet5);havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(0, 0, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 102#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 108#L562 main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; 106#L567-5 [2018-11-23 00:11:57,641 INFO L796 eck$LassoCheckResult]: Loop: 106#L567-5 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 109#L567-1 assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; 105#L567-3 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 106#L567-5 [2018-11-23 00:11:57,641 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:57,641 INFO L82 PathProgramCache]: Analyzing trace with hash 889608977, now seen corresponding path program 1 times [2018-11-23 00:11:57,641 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:57,642 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:57,642 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,643 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:57,643 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:57,657 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:57,661 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:57,662 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 1 times [2018-11-23 00:11:57,662 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:57,662 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:57,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,663 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:57,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,666 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:57,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:57,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:11:57,673 INFO L82 PathProgramCache]: Analyzing trace with hash -1902120908, now seen corresponding path program 1 times [2018-11-23 00:11:57,673 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:11:57,673 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:11:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,675 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:11:57,675 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:11:57,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:57,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:11:58,181 WARN L180 SmtUtils]: Spent 359.00 ms on a formula simplification. DAG size of input: 117 DAG size of output: 112 [2018-11-23 00:11:58,185 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:58,191 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:58,285 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:58,290 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:58,368 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:11:58,369 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:183, output treesize:159 [2018-11-23 00:11:58,450 INFO L216 LassoAnalysis]: Preferences: [2018-11-23 00:11:58,450 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-23 00:11:58,451 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-23 00:11:58,451 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-23 00:11:58,451 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-23 00:11:58,451 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-23 00:11:58,451 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-23 00:11:58,451 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-23 00:11:58,451 INFO L131 ssoRankerPreferences]: Filename of dumped script: nondet_ll_search-alloca_false-termination.c.i_Iteration2_Lasso [2018-11-23 00:11:58,451 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-23 00:11:58,451 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-23 00:11:58,455 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,471 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,474 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,476 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,478 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,603 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,604 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,606 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,607 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,609 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,611 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,613 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,615 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,620 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,622 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,623 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-23 00:11:58,764 WARN L180 SmtUtils]: Spent 120.00 ms on a formula simplification. DAG size of input: 60 DAG size of output: 59 [2018-11-23 00:11:58,971 WARN L180 SmtUtils]: Spent 142.00 ms on a formula simplification that was a NOOP. DAG size: 61 [2018-11-23 00:11:59,100 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-23 00:11:59,100 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-23 00:11:59,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,103 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,104 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,105 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,109 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,109 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,110 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,112 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,112 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,112 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,112 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,112 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,114 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,114 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,116 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,117 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,117 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,118 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,118 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:11:59,118 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:11:59,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,143 INFO L402 nArgumentSynthesizer]: We have 36 Motzkin's Theorem applications. [2018-11-23 00:11:59,143 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:11:59,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,240 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,240 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,244 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:11:59,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,247 INFO L402 nArgumentSynthesizer]: We have 16 Motzkin's Theorem applications. [2018-11-23 00:11:59,247 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,260 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,260 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,262 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,262 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,263 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,265 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,265 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,267 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,271 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,271 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,274 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,275 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,275 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,276 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,276 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,276 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,280 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,280 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,280 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,280 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,281 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,284 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,285 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,286 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,287 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,287 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,287 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,287 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,288 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,289 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,289 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,289 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,289 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,290 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:11:59,291 INFO L403 nArgumentSynthesizer]: A total of 2 supporting invariants were added. [2018-11-23 00:11:59,294 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,295 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,295 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,296 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,298 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,298 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,299 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,300 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-23 00:11:59,300 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-23 00:11:59,300 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,301 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-23 00:11:59,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-23 00:11:59,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,302 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,312 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,312 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,312 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,312 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,313 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,313 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,313 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,314 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,314 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,319 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,319 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,321 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,321 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,323 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,323 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,324 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,324 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,326 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,328 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,328 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,328 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,328 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,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-23 00:11:59,330 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,330 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:11:59,330 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:11:59,330 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,369 INFO L402 nArgumentSynthesizer]: We have 54 Motzkin's Theorem applications. [2018-11-23 00:11:59,370 INFO L403 nArgumentSynthesizer]: A total of 9 supporting invariants were added. [2018-11-23 00:11:59,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,519 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,520 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,520 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,520 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,520 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,522 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,522 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,527 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,527 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:11:59,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,531 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-23 00:11:59,531 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:11:59,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,618 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,618 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,618 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,620 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,620 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,620 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,621 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,621 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,623 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,623 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,624 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,625 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,625 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,625 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,625 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,625 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,626 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,627 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,629 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,633 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,633 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,634 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,634 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,635 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,636 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,636 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,636 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,636 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,637 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,637 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,637 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,638 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,638 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,638 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,639 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,641 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,641 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,642 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,642 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,642 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,643 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,643 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,643 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,644 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,644 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,644 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,644 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,645 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,645 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,646 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,647 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:11:59,647 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:11:59,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,652 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,653 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,653 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,655 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,655 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,655 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,655 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,656 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,656 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,656 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,657 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,657 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:11:59,658 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:11:59,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,660 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-23 00:11:59,660 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,660 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,661 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,661 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,662 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,662 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,662 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,663 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,663 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,663 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,663 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,663 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,663 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,664 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,665 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,665 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,665 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,666 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,666 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,667 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,667 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,667 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,667 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,667 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,668 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,668 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,668 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,669 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,669 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,671 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,671 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,673 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,673 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,674 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,676 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,677 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:11:59,677 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:11:59,677 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,715 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-23 00:11:59,715 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:11:59,831 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,831 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,832 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,832 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,833 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,833 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,838 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,839 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,839 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:11:59,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,843 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-23 00:11:59,843 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 00:11:59,854 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,855 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,855 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,856 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,856 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,857 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,857 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,857 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,857 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,858 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,858 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,860 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,860 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,860 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,861 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,861 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,861 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,861 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,862 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,862 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,863 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,863 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,864 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,866 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,866 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,867 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,867 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,868 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,868 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,868 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,868 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,868 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,868 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,869 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,869 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,872 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,872 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,872 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,873 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,874 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,874 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,874 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,875 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,875 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,875 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,876 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,876 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,876 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,876 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,876 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,876 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,877 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,877 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,877 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,878 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,878 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,878 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,878 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,878 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,879 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,879 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,879 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,880 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,880 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,880 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,880 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,880 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,882 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:11:59,882 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:11:59,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,887 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,888 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,888 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,888 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,888 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,888 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,889 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,889 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,889 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,890 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,890 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,890 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,890 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,890 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,891 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,891 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,892 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,892 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:11:59,892 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:11:59,893 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,893 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,893 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-23 00:11:59,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,894 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,894 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,894 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,894 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,894 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,895 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:11:59,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,895 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,896 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,896 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,896 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,896 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,896 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,897 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:11:59,897 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,898 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,898 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,898 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,898 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,898 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,899 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:11:59,899 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,899 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,900 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,900 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,900 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,900 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,900 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,900 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,901 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:11:59,901 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,902 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,902 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,902 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,902 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,903 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:11:59,903 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:11:59,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,906 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:11:59,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:11:59,906 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:11:59,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:11:59,907 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:11:59,907 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:11:59,908 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:11:59,908 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:11:59,908 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:11:59,909 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:11:59,909 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:11:59,959 INFO L402 nArgumentSynthesizer]: We have 90 Motzkin's Theorem applications. [2018-11-23 00:11:59,959 INFO L403 nArgumentSynthesizer]: A total of 15 supporting invariants were added. [2018-11-23 00:12:00,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,089 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,090 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,090 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,090 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,091 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,091 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,096 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:00,097 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,100 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-23 00:12:00,100 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-23 00:12:00,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,113 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,114 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,114 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,115 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,115 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,116 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,116 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,119 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,119 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,120 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,121 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,121 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,121 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,121 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,122 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,122 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,124 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,125 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,125 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,126 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,126 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,127 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,127 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,127 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,128 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,128 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,130 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,131 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,131 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,132 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,133 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,134 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,135 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,136 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,137 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,137 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,137 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,137 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,137 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,137 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,138 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,139 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,139 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,139 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,139 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,139 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,141 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,141 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,147 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,147 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,147 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,148 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,148 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,150 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,150 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,150 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,151 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-23 00:12:00,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,152 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,152 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,153 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-23 00:12:00,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,154 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,159 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,160 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,161 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,161 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,161 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,162 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,162 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,163 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,163 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,164 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,164 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,164 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,165 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,167 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,167 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,168 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,168 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,168 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,168 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,168 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,168 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,169 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,169 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,169 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,170 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,170 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,170 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,171 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:12:00,171 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:12:00,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,203 INFO L402 nArgumentSynthesizer]: We have 54 Motzkin's Theorem applications. [2018-11-23 00:12:00,203 INFO L403 nArgumentSynthesizer]: A total of 9 supporting invariants were added. [2018-11-23 00:12:00,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,361 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,361 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,361 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,362 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,362 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,367 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,367 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,368 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,368 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,368 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,368 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:00,368 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,371 INFO L402 nArgumentSynthesizer]: We have 24 Motzkin's Theorem applications. [2018-11-23 00:12:00,371 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:00,381 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,382 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,382 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,382 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,382 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,382 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,382 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,383 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,384 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,384 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,384 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,384 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,384 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,385 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,385 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,388 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,389 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,389 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,390 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,390 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,391 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,391 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,391 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,392 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,392 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,395 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,395 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,396 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,397 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,398 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,398 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,399 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,402 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,402 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,403 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,404 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,404 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,404 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,405 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,405 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,405 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,405 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,405 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,406 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,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-23 00:12:00,407 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,407 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,407 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,407 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,407 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,407 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,407 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,409 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,409 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,410 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,411 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,411 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,411 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,411 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,412 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,412 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,412 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,413 INFO L402 nArgumentSynthesizer]: We have 9 Motzkin's Theorem applications. [2018-11-23 00:12:00,413 INFO L403 nArgumentSynthesizer]: A total of 3 supporting invariants were added. [2018-11-23 00:12:00,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,419 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,419 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,419 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,419 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,420 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,421 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,421 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,421 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,422 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,423 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,423 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,424 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,424 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:00,424 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,424 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,424 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,424 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-23 00:12:00,424 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-23 00:12:00,425 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,425 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,426 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-23 00:12:00,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,426 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,426 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,426 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,427 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,427 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,427 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,429 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,429 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,430 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,430 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,430 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,430 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,430 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,430 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,432 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,432 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,432 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,432 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,433 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,433 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,433 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,433 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,435 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,436 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,436 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,438 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,439 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,439 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,439 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,439 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,440 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,440 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,444 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,444 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,444 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,444 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,445 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,445 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,445 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,445 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,445 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,448 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,448 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:12:00,448 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:12:00,448 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,486 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-23 00:12:00,486 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:12:00,659 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,659 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,660 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,662 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,662 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,669 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,669 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,669 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,669 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,670 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,670 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:00,670 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,675 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-23 00:12:00,675 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 00:12:00,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,691 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,695 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,696 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,697 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,701 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,701 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,702 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,702 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,702 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,704 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,705 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,705 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,706 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,707 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,711 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,711 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,712 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,712 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,712 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,714 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,714 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,715 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,715 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,715 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,715 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,715 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,716 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,717 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,720 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,720 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,721 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,721 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,721 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,722 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,724 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,725 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,725 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,725 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,725 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,726 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,726 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,728 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,729 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,729 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,729 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,729 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,730 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,730 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,731 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,732 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,732 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,732 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,732 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,732 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,733 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,733 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,733 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,733 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,736 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,736 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,736 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,736 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,736 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,737 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,738 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:00,739 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:00,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,748 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,748 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,748 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,749 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,749 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,751 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,751 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,752 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,752 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,752 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,753 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,755 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,756 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-23 00:12:00,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,756 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,756 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,756 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:00,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:00,757 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,759 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-23 00:12:00,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,760 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,760 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,761 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,761 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,762 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,763 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,764 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,764 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,764 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,764 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,765 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,765 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,765 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,766 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,766 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,767 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,768 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,768 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,768 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,769 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,769 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,770 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,770 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,771 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,772 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,772 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,772 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,772 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,773 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,773 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,773 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,774 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,774 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,775 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,776 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,776 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,776 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,778 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:00,778 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:00,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,785 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,785 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,785 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:00,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:00,786 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:00,786 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:00,787 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:00,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:00,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:00,789 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:00,790 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:00,790 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:00,790 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:12:00,790 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:12:00,790 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,035 INFO L402 nArgumentSynthesizer]: We have 90 Motzkin's Theorem applications. [2018-11-23 00:12:01,035 INFO L403 nArgumentSynthesizer]: A total of 15 supporting invariants were added. [2018-11-23 00:12:01,286 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,287 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,287 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,288 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,290 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:01,290 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:01,297 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,297 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,298 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,298 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,298 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,298 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:01,298 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,304 INFO L402 nArgumentSynthesizer]: We have 40 Motzkin's Theorem applications. [2018-11-23 00:12:01,304 INFO L403 nArgumentSynthesizer]: A total of 10 supporting invariants were added. [2018-11-23 00:12:01,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,323 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,323 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,323 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,323 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,323 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,323 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,324 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,324 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,326 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,326 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,326 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,328 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:01,328 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:01,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,334 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,334 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,334 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,334 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,335 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,336 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,337 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,338 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:01,338 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:01,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,343 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,344 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,344 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,345 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,346 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,346 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,346 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,346 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,346 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,347 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,348 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:01,348 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:01,353 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,353 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,353 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,354 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,355 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,355 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,357 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,358 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,360 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,360 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,361 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,362 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,363 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,363 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,363 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,363 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,363 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,363 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,364 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,364 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,365 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,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-23 00:12:01,366 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,366 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,367 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,369 INFO L402 nArgumentSynthesizer]: We have 15 Motzkin's Theorem applications. [2018-11-23 00:12:01,369 INFO L403 nArgumentSynthesizer]: A total of 5 supporting invariants were added. [2018-11-23 00:12:01,378 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,379 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,380 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,380 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,380 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,382 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,383 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,384 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,385 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,385 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,386 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,386 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,386 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,386 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,386 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-23 00:12:01,387 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-23 00:12:01,387 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,388 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-23 00:12:01,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-23 00:12:01,389 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,389 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,389 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,389 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,389 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,390 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,390 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,392 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,393 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,393 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,395 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,396 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,396 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,398 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,398 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,399 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,399 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,399 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,401 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,401 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,401 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,401 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,402 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,402 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,402 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,405 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,405 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,406 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,406 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,406 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,406 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,407 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,409 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,409 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,409 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:12:01,409 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:12:01,409 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,443 INFO L402 nArgumentSynthesizer]: We have 72 Motzkin's Theorem applications. [2018-11-23 00:12:01,443 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:12:01,752 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,753 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,753 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,753 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,754 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,755 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,755 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,763 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,763 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:01,764 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,767 INFO L402 nArgumentSynthesizer]: We have 32 Motzkin's Theorem applications. [2018-11-23 00:12:01,767 INFO L403 nArgumentSynthesizer]: A total of 8 supporting invariants were added. [2018-11-23 00:12:01,780 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,781 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,781 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,781 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,782 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,785 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,785 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,788 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,788 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,788 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,789 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,789 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,789 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,789 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,789 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,791 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,791 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,791 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,792 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,792 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,792 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,792 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,793 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,793 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,795 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,796 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,796 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,796 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,796 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,797 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,797 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,797 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,797 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,797 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,799 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,799 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,800 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,801 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,801 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,803 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,804 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,804 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,804 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,804 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,805 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,805 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,806 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,807 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,807 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,807 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,807 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,807 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,808 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,808 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,808 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,808 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,810 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,810 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,811 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,812 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,813 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,813 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,813 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,814 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,814 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,814 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,816 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,817 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,818 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-23 00:12:01,819 INFO L403 nArgumentSynthesizer]: A total of 4 supporting invariants were added. [2018-11-23 00:12:01,823 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,824 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,824 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,824 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,824 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,824 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,825 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,825 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,825 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,827 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,830 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,830 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,830 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,830 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-23 00:12:01,831 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,831 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,831 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,831 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-23 00:12:01,831 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-23 00:12:01,831 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,833 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,833 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-23 00:12:01,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,834 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,834 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,834 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,834 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,835 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:01,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,838 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,838 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,839 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,839 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:01,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,842 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,842 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,843 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:01,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,845 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,846 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,846 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,846 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,846 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,846 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,847 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:01,847 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,849 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,849 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,849 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,849 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,850 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,850 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,851 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:01,851 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:01,855 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,855 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,856 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,856 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,856 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:01,856 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:01,856 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:01,856 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,857 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:01,857 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:01,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:01,859 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:01,859 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:01,860 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:01,860 INFO L205 nArgumentSynthesizer]: 2 stem disjuncts [2018-11-23 00:12:01,860 INFO L206 nArgumentSynthesizer]: 3 loop disjuncts [2018-11-23 00:12:01,860 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:01,921 INFO L402 nArgumentSynthesizer]: We have 108 Motzkin's Theorem applications. [2018-11-23 00:12:01,921 INFO L403 nArgumentSynthesizer]: A total of 18 supporting invariants were added. [2018-11-23 00:12:02,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,601 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,602 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,602 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,602 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,604 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:02,604 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:02,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,616 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,616 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-23 00:12:02,617 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,622 INFO L402 nArgumentSynthesizer]: We have 48 Motzkin's Theorem applications. [2018-11-23 00:12:02,622 INFO L403 nArgumentSynthesizer]: A total of 12 supporting invariants were added. [2018-11-23 00:12:02,647 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,647 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,647 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,648 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,648 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,648 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,648 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,648 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,649 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,651 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,651 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,651 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,651 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,652 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,652 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,652 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,653 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:02,653 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:02,657 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,657 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,658 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,658 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,658 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,658 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,658 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,658 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,659 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,659 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,661 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,661 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,661 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,661 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,662 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,662 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,662 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,663 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:02,663 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:02,667 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,667 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,667 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,668 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,668 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,668 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,668 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,668 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,668 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,669 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,671 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,671 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,672 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,673 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:02,673 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:02,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,677 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,677 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,677 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,678 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,678 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,678 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,681 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,681 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,681 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,681 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,682 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,685 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,685 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,686 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,688 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,688 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,688 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,688 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,689 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,689 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,689 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,689 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,690 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,692 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,692 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,693 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,693 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,693 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,693 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,693 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,695 INFO L402 nArgumentSynthesizer]: We have 18 Motzkin's Theorem applications. [2018-11-23 00:12:02,695 INFO L403 nArgumentSynthesizer]: A total of 6 supporting invariants were added. [2018-11-23 00:12:02,702 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,702 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,703 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,703 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,703 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,703 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,704 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,706 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,707 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,707 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,707 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,708 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,708 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,708 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,708 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-23 00:12:02,711 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-23 00:12:02,711 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-23 00:12:02,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-23 00:12:02,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-23 00:12:02,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-23 00:12:02,712 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-23 00:12:02,712 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-23 00:12:02,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-23 00:12:02,715 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-23 00:12:02,715 INFO L488 BuchiCegarLoop]: Result of lasso check was UNKNOWN. I will concatenate loop to stem and try again. [2018-11-23 00:12:02,715 INFO L794 eck$LassoCheckResult]: Stem: 107#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 103#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 104#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 101#L552-4 assume !(0 != init_nondet_ll_#t~nondet5);havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(0, 0, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 102#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 108#L562 main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; 106#L567-5 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 109#L567-1 assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; 105#L567-3 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 106#L567-5 [2018-11-23 00:12:02,715 INFO L796 eck$LassoCheckResult]: Loop: 106#L567-5 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 109#L567-1 assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; 105#L567-3 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 106#L567-5 [2018-11-23 00:12:02,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:02,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1902120908, now seen corresponding path program 2 times [2018-11-23 00:12:02,716 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:02,716 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,717 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:02,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:02,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:02,734 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:02,734 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 2 times [2018-11-23 00:12:02,734 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:02,734 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,735 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:02,735 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:02,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:02,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:02,741 INFO L82 PathProgramCache]: Analyzing trace with hash 1714562097, now seen corresponding path program 3 times [2018-11-23 00:12:02,741 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:02,741 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:02,741 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:02,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:02,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 00:12:02,919 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:02,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 00:12:02,921 INFO L223 ckRefinementStrategy]: Switched to mode Z3_FP No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/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-23 00:12:02,936 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 00:12:02,962 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-11-23 00:12:02,962 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 00:12:02,964 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 00:12:03,031 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 11 treesize of output 8 [2018-11-23 00:12:03,035 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-23 00:12:03,035 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,039 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,048 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 11 treesize of output 8 [2018-11-23 00:12:03,051 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-23 00:12:03,051 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,055 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,061 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,061 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:26, output treesize:18 [2018-11-23 00:12:03,134 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-23 00:12:03,137 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 11 treesize of output 3 [2018-11-23 00:12:03,138 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,141 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,157 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-23 00:12:03,159 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 11 treesize of output 3 [2018-11-23 00:12:03,160 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,163 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,167 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 2 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-23 00:12:03,168 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 3 variables, input treesize:29, output treesize:7 [2018-11-23 00:12:03,204 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 00:12:03,234 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2018-11-23 00:12:03,235 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 14 [2018-11-23 00:12:03,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 00:12:03,356 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=152, Unknown=0, NotChecked=0, Total=182 [2018-11-23 00:12:03,357 INFO L87 Difference]: Start difference. First operand 11 states and 15 transitions. cyclomatic complexity: 6 Second operand 14 states. [2018-11-23 00:12:03,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 00:12:03,807 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 00:12:03,808 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 00:12:03,808 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 28 states and 31 transitions. [2018-11-23 00:12:03,809 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2018-11-23 00:12:03,810 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 28 states to 17 states and 20 transitions. [2018-11-23 00:12:03,810 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 15 [2018-11-23 00:12:03,810 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 15 [2018-11-23 00:12:03,810 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 20 transitions. [2018-11-23 00:12:03,811 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-23 00:12:03,811 INFO L705 BuchiCegarLoop]: Abstraction has 17 states and 20 transitions. [2018-11-23 00:12:03,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states and 20 transitions. [2018-11-23 00:12:03,812 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 12. [2018-11-23 00:12:03,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2018-11-23 00:12:03,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 15 transitions. [2018-11-23 00:12:03,812 INFO L728 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-23 00:12:03,812 INFO L608 BuchiCegarLoop]: Abstraction has 12 states and 15 transitions. [2018-11-23 00:12:03,812 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-23 00:12:03,813 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 12 states and 15 transitions. [2018-11-23 00:12:03,813 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2018-11-23 00:12:03,813 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-23 00:12:03,813 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-23 00:12:03,814 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1] [2018-11-23 00:12:03,814 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2018-11-23 00:12:03,814 INFO L794 eck$LassoCheckResult]: Stem: 221#ULTIMATE.startENTRY #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; 217#L-1 havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; 218#L552-3 assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); 219#L552-4 assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); 220#L558-1 init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; 222#L562 main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; 216#L567-5 [2018-11-23 00:12:03,814 INFO L796 eck$LassoCheckResult]: Loop: 216#L567-5 safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; 223#L567-1 assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; 215#L567-3 assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; 216#L567-5 [2018-11-23 00:12:03,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:03,815 INFO L82 PathProgramCache]: Analyzing trace with hash 889607055, now seen corresponding path program 1 times [2018-11-23 00:12:03,815 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:03,815 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,816 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:03,816 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:03,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:03,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:03,828 INFO L82 PathProgramCache]: Analyzing trace with hash 58692, now seen corresponding path program 3 times [2018-11-23 00:12:03,828 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:03,828 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 00:12:03,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:03,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:03,835 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 00:12:03,835 INFO L82 PathProgramCache]: Analyzing trace with hash -1959379210, now seen corresponding path program 1 times [2018-11-23 00:12:03,835 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-23 00:12:03,835 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-23 00:12:03,835 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,836 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 00:12:03,836 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 00:12:03,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:03,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 00:12:04,265 WARN L180 SmtUtils]: Spent 299.00 ms on a formula simplification. DAG size of input: 118 DAG size of output: 110 [2018-11-23 00:12:04,268 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:12:04,279 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:12:04,361 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-0 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:12:04,367 INFO L267 ElimStorePlain]: Start of recursive call 4: 1 dim-1 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-11-23 00:12:04,434 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-2 vars, End of recursive call: 2 dim-0 vars, and 1 xjuncts. [2018-11-23 00:12:04,434 INFO L202 ElimStorePlain]: Needed 5 recursive calls to eliminate 2 variables, input treesize:176, output treesize:152 ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [?] assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [?] assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; [L567] curr != ((void *)0) && curr->val != i [L567] EXPR curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR curr->next [L568] curr = curr->next ----- [2018-11-23 00:12:04,523 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 23.11 12:12:04 BoogieIcfgContainer [2018-11-23 00:12:04,523 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-23 00:12:04,523 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 00:12:04,523 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 00:12:04,523 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 00:12:04,524 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 12:11:55" (3/4) ... [2018-11-23 00:12:04,527 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [?] assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [?] assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; [L567] curr != ((void *)0) && curr->val != i [L567] EXPR curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR curr->next [L568] curr = curr->next ----- [2018-11-23 00:12:04,575 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_b44f7c53-cbc2-400a-959f-e7ca5707ad95/bin-2019/uautomizer/witness.graphml [2018-11-23 00:12:04,575 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 00:12:04,576 INFO L168 Benchmark]: Toolchain (without parser) took 9382.35 ms. Allocated memory was 1.0 GB in the beginning and 1.7 GB in the end (delta: 653.3 MB). Free memory was 956.6 MB in the beginning and 1.0 GB in the end (delta: -71.1 MB). Peak memory consumption was 582.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,577 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:12:04,577 INFO L168 Benchmark]: CACSL2BoogieTranslator took 401.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,578 INFO L168 Benchmark]: Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,579 INFO L168 Benchmark]: Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,579 INFO L168 Benchmark]: RCFGBuilder took 235.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,580 INFO L168 Benchmark]: BuchiAutomizer took 8640.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.7 MB). Peak memory consumption was 585.7 MB. Max. memory is 11.5 GB. [2018-11-23 00:12:04,580 INFO L168 Benchmark]: Witness Printer took 52.31 ms. Allocated memory is still 1.7 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 00:12:04,584 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 985.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 401.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 158.3 MB). Free memory was 956.6 MB in the beginning and 1.1 GB in the end (delta: -189.5 MB). Peak memory consumption was 29.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 29.46 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.15 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 3.3 MB). Peak memory consumption was 3.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 235.87 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 21.0 MB). Peak memory consumption was 21.0 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 8640.02 ms. Allocated memory was 1.2 GB in the beginning and 1.7 GB in the end (delta: 494.9 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 90.7 MB). Peak memory consumption was 585.7 MB. Max. memory is 11.5 GB. * Witness Printer took 52.31 ms. Allocated memory is still 1.7 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 2 terminating modules (1 trivial, 1 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function n + -1 * i and consists of 5 locations. 1 modules have a trivial ranking function, the largest among these consists of 14 locations. The remainder module has 12 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 8.5s and 3 iterations. TraceHistogramMax:1. Analysis of lassos took 7.9s. Construction of modules took 0.1s. Büchi inclusion checks took 0.4s. Highest rank in rank-based complementation 3. Minimization of det autom 2. Minimization of nondet autom 0. Automata minimization 0.0s AutomataMinimizationTime, 2 MinimizatonAttempts, 5 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 12 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 21 SDtfs, 80 SDslu, 69 SDs, 0 SdLazy, 126 SolverSat, 13 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc1 concLT0 SILN0 SILU0 SILI0 SILT0 lasso1 LassoPreprocessingBenchmarks: Lassos: inital254 mio100 ax100 hnf100 lsp97 ukn41 mio100 lsp24 div100 bol100 ite100 ukn100 eq196 hnf87 smp100 dnf162 smp100 tf100 neg94 sie112 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 52ms VariablesStem: 3 VariablesLoop: 3 DisjunctsStem: 2 DisjunctsLoop: 2 SupportingInvariants: 4 MotzkinApplications: 20 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 0 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.0s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 567]: Nontermination argument in form of an infinite program execution. Nontermination argument in form of an infinite execution State at position 0 is {} State at position 1 is {NULL=0, curr=2, \result=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTBinaryExpression@5f383e3d=0, head=2, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@604f9520=0, n=0, next_node=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5edc443=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@49890d3f=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31c9b507=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@666fb5f4=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29d4e99e=0, \old(n)=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@5edc443=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@31c9b507=2, \result=0, i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFieldReference@3edcee5e=0, i=6, \result=2, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTUnaryExpression@294e6e04=0, n=0, next_node=0, head=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@147b90b2=0, curr=0, NULL=0, head=2, head=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@29d4e99e=0, \old(i)=6, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@604f9520=0, head=0, head=0, curr=2, curr=0} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 567]: Nonterminating execution ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [?] assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [?] assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; [L567] curr != ((void *)0) && curr->val != i [L567] EXPR curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR curr->next [L568] curr = curr->next ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0]; [?] havoc main_#res;havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset;main_~n~0 := main_#t~nondet9;havoc main_#t~nondet9;init_nondet_ll_#in~n := main_~n~0;havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset;havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~n := init_nondet_ll_#in~n;havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset;call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12);init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset;call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4);init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset;init_nondet_ll_~i~0 := 1; [?] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [?] assume 0 != init_nondet_ll_#t~nondet5;havoc init_nondet_ll_#t~nondet5;call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [?] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [?] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset;main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset;havoc main_#t~ret10.base, main_#t~ret10.offset;safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset;safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset;safe_search_~i := safe_search_#in~i;safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] #NULL.base, #NULL.offset := 0, 0; [?] #valid := #valid[0 := 0]; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10.base, main_#t~ret10.offset, main_#t~nondet11, main_~n~0, main_~head~1.base, main_~head~1.offset; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] havoc init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset, init_nondet_ll_#t~malloc4.base, init_nondet_ll_#t~malloc4.offset, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0.base, init_nondet_ll_~next_node~0.offset, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L549] call init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset := init_nondet_ll_#t~malloc2.base, init_nondet_ll_#t~malloc2.offset; [L550] call write~int(0, init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset, 4); [L551] init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset := init_nondet_ll_~curr~0.base, init_nondet_ll_~curr~0.offset; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] assume !(init_nondet_ll_~i~0 < init_nondet_ll_~n); [L558-L561] assume 0 != init_nondet_ll_#t~nondet5; [L558] havoc init_nondet_ll_#t~nondet5; [L559] call write~$Pointer$(init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset, init_nondet_ll_~curr~0.base, 4 + init_nondet_ll_~curr~0.offset, 8); [L562] init_nondet_ll_#res.base, init_nondet_ll_#res.offset := init_nondet_ll_~head~0.base, init_nondet_ll_~head~0.offset; [L574] main_#t~ret10.base, main_#t~ret10.offset := init_nondet_ll_#res.base, init_nondet_ll_#res.offset; [L574] main_~head~1.base, main_~head~1.offset := main_#t~ret10.base, main_#t~ret10.offset; [L574] havoc main_#t~ret10.base, main_#t~ret10.offset; [L575] safe_search_#in~head.base, safe_search_#in~head.offset, safe_search_#in~i := main_~head~1.base, main_~head~1.offset, main_#t~nondet11; [L575] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head.base, safe_search_~head.offset, safe_search_~i, safe_search_~curr~1.base, safe_search_~curr~1.offset; [L564-L570] safe_search_~head.base, safe_search_~head.offset := safe_search_#in~head.base, safe_search_#in~head.offset; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_~head.base, safe_search_~head.offset; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [?] havoc main_#res; [?] havoc main_#t~nondet9, main_#t~ret10, main_#t~nondet11, main_~n~0, main_~head~1; [L573] main_~n~0 := main_#t~nondet9; [L573] havoc main_#t~nondet9; [L574] init_nondet_ll_#in~n := main_~n~0; [L574] havoc init_nondet_ll_#res; [L574] havoc init_nondet_ll_#t~malloc2, init_nondet_ll_#t~malloc4, init_nondet_ll_#t~post3, init_nondet_ll_~i~0, init_nondet_ll_~next_node~0, init_nondet_ll_#t~nondet5, init_nondet_ll_~n, init_nondet_ll_~head~0, init_nondet_ll_~curr~0; [L546-L563] init_nondet_ll_~n := init_nondet_ll_#in~n; [L548] havoc init_nondet_ll_~head~0; [L549] FCALL call init_nondet_ll_#t~malloc2 := #Ultimate.alloc(12); [L549] init_nondet_ll_~curr~0 := init_nondet_ll_#t~malloc2; [L550] FCALL call write~int(0, { base: init_nondet_ll_~curr~0!base, offset: init_nondet_ll_~curr~0!offset }, 4); [L551] init_nondet_ll_~head~0 := init_nondet_ll_~curr~0; [L552] init_nondet_ll_~i~0 := 1; [L552-L557] COND TRUE !(init_nondet_ll_~i~0 < init_nondet_ll_~n) [L558-L561] COND TRUE 0 != init_nondet_ll_#t~nondet5 [L558] havoc init_nondet_ll_#t~nondet5; [L559] FCALL call write~$Pointer$(init_nondet_ll_~head~0, { base: init_nondet_ll_~curr~0!base, offset: 4 + init_nondet_ll_~curr~0!offset }, 8); [L562] init_nondet_ll_#res := init_nondet_ll_~head~0; [L574] main_#t~ret10 := init_nondet_ll_#res; [L574] main_~head~1 := main_#t~ret10; [L574] havoc main_#t~ret10; [L575] safe_search_#in~head, safe_search_#in~i := main_~head~1, main_#t~nondet11; [L575] havoc safe_search_#t~mem8, safe_search_#t~mem6, safe_search_#t~short7, safe_search_~head, safe_search_~i, safe_search_~curr~1; [L564-L570] safe_search_~head := safe_search_#in~head; [L564-L570] safe_search_~i := safe_search_#in~i; [L566] safe_search_~curr~1 := safe_search_~head; [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] #NULL := { base: 0, offset: 0 }; [?] #valid[0] := 0; [L573] ~n~0 := #t~nondet9; [L573] havoc #t~nondet9; [L546-L563] ~n := #in~n; [L548] havoc ~head~0; [L549] FCALL call #t~malloc2 := #Ultimate.alloc(12); [L549] ~curr~0 := #t~malloc2; [L550] FCALL call write~int(0, { base: ~curr~0!base, offset: ~curr~0!offset }, 4); [L551] ~head~0 := ~curr~0; [L552] ~i~0 := 1; [L552-L557] COND TRUE !(~i~0 < ~n) [L558-L561] COND TRUE 0 != #t~nondet5 [L558] havoc #t~nondet5; [L559] FCALL call write~$Pointer$(~head~0, { base: ~curr~0!base, offset: 4 + ~curr~0!offset }, 8); [L562] #res := ~head~0; [L574] ~head~1 := #t~ret10; [L574] havoc #t~ret10; [L564-L570] ~head := #in~head; [L564-L570] ~i := #in~i; [L566] ~curr~1 := ~head; [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [?] assume safe_search_#t~short7;call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4);safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [?] assume !!safe_search_#t~short7;havoc safe_search_#t~mem6;havoc safe_search_#t~short7;call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8);safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset;havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1.base != 0 || safe_search_~curr~1.offset != 0; [L567] assume safe_search_#t~short7; [L567] call safe_search_#t~mem6 := read~int(safe_search_~curr~1.base, safe_search_~curr~1.offset, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] assume !!safe_search_#t~short7; [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] call safe_search_#t~mem8.base, safe_search_#t~mem8.offset := read~$Pointer$(safe_search_~curr~1.base, 4 + safe_search_~curr~1.offset, 8); [L568] safe_search_~curr~1.base, safe_search_~curr~1.offset := safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L568] havoc safe_search_#t~mem8.base, safe_search_#t~mem8.offset; [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [L567] safe_search_#t~short7 := safe_search_~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE safe_search_#t~short7 [L567] FCALL call safe_search_#t~mem6 := read~int({ base: safe_search_~curr~1!base, offset: safe_search_~curr~1!offset }, 4); [L567] safe_search_#t~short7 := safe_search_#t~mem6 != safe_search_~i; [L567-L569] COND FALSE !(!safe_search_#t~short7) [L567] havoc safe_search_#t~mem6; [L567] havoc safe_search_#t~short7; [L568] FCALL call safe_search_#t~mem8 := read~$Pointer$({ base: safe_search_~curr~1!base, offset: 4 + safe_search_~curr~1!offset }, 8); [L568] safe_search_~curr~1 := safe_search_#t~mem8; [L568] havoc safe_search_#t~mem8; [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [L567] #t~short7 := ~curr~1 != { base: 0, offset: 0 }; [L567] COND TRUE #t~short7 [L567] FCALL call #t~mem6 := read~int({ base: ~curr~1!base, offset: ~curr~1!offset }, 4); [L567] #t~short7 := #t~mem6 != ~i; [L567-L569] COND FALSE !(!#t~short7) [L567] havoc #t~mem6; [L567] havoc #t~short7; [L568] FCALL call #t~mem8 := read~$Pointer$({ base: ~curr~1!base, offset: 4 + ~curr~1!offset }, 8); [L568] ~curr~1 := #t~mem8; [L568] havoc #t~mem8; [L567] curr != ((void *)0) && curr->val != i [L567] EXPR curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR curr->next [L568] curr = curr->next ----- Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L573] int n = __VERIFIER_nondet_int(); [L548] node_t* head; [L549] node_t* curr = malloc(sizeof(node_t)); [L550] curr->val = 0 [L551] head = curr [L552] int i = 1; [L552] COND FALSE !(i < n) [L558] COND TRUE __VERIFIER_nondet_int() [L559] curr->next = head [L562] return head; [L574] node_t* head = init_nondet_ll(n); [L566] node_t* curr = head; Loop: [L567] curr != ((void *)0) && curr->val != i [L567] EXPR curr->val [L567] curr != ((void *)0) && curr->val != i [L567] COND TRUE curr != ((void *)0) && curr->val != i [L568] EXPR curr->next [L568] curr = curr->next End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...