./Ultimate.py --spec ../../sv-benchmarks/c/Termination.prp --file ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 5842f4b8 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/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 32bit --witnessprinter.graph.data.programhash 375118f5e6b201fc35ff4858369e05c815397841 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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-5842f4b [2018-11-18 11:06:29,638 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-18 11:06:29,639 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-18 11:06:29,646 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-18 11:06:29,646 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-18 11:06:29,647 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-18 11:06:29,647 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-18 11:06:29,648 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-18 11:06:29,650 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-18 11:06:29,650 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-18 11:06:29,651 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-18 11:06:29,651 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-18 11:06:29,652 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-18 11:06:29,652 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-18 11:06:29,653 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-18 11:06:29,653 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-18 11:06:29,654 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-18 11:06:29,655 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-18 11:06:29,656 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-18 11:06:29,657 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-18 11:06:29,659 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-18 11:06:29,659 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-18 11:06:29,661 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-18 11:06:29,661 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-18 11:06:29,661 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-18 11:06:29,662 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-18 11:06:29,663 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-18 11:06:29,663 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-18 11:06:29,664 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-18 11:06:29,665 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-18 11:06:29,665 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-18 11:06:29,665 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-18 11:06:29,665 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-18 11:06:29,665 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-18 11:06:29,666 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-18 11:06:29,666 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-18 11:06:29,666 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-18 11:06:29,674 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-18 11:06:29,674 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-18 11:06:29,675 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-18 11:06:29,675 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-18 11:06:29,675 INFO L133 SettingsManager]: * Use SBE=true [2018-11-18 11:06:29,675 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-18 11:06:29,675 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-18 11:06:29,675 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-18 11:06:29,675 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-18 11:06:29,676 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-18 11:06:29,676 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-18 11:06:29,677 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-18 11:06:29,678 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-18 11:06:29,678 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-18 11:06:29,678 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-18 11:06:29,680 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-18 11:06:29,680 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-18 11:06:29,680 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-18 11:06:29,681 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-18 11:06:29,681 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_c6f0187c-13b5-4d69-8c43-297ab51fc56b/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 -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 375118f5e6b201fc35ff4858369e05c815397841 [2018-11-18 11:06:29,704 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-18 11:06:29,713 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-18 11:06:29,716 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-18 11:06:29,717 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-18 11:06:29,717 INFO L276 PluginConnector]: CDTParser initialized [2018-11-18 11:06:29,718 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-18 11:06:29,755 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/data/0e60fd75e/5fba0dded0254432a1fcbbb237260130/FLAGe5ea7f172 [2018-11-18 11:06:30,106 INFO L307 CDTParser]: Found 1 translation units. [2018-11-18 11:06:30,106 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/sv-benchmarks/c/systemc/kundu_true-unreach-call_false-termination.cil.c [2018-11-18 11:06:30,113 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/data/0e60fd75e/5fba0dded0254432a1fcbbb237260130/FLAGe5ea7f172 [2018-11-18 11:06:30,524 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/data/0e60fd75e/5fba0dded0254432a1fcbbb237260130 [2018-11-18 11:06:30,527 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-18 11:06:30,528 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-18 11:06:30,529 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-18 11:06:30,529 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-18 11:06:30,532 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-18 11:06:30,532 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,534 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2904fee9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30, skipping insertion in model container [2018-11-18 11:06:30,535 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,541 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-18 11:06:30,563 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-18 11:06:30,693 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:06:30,696 INFO L191 MainTranslator]: Completed pre-run [2018-11-18 11:06:30,724 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-18 11:06:30,736 INFO L195 MainTranslator]: Completed translation [2018-11-18 11:06:30,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30 WrapperNode [2018-11-18 11:06:30,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-18 11:06:30,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-18 11:06:30,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-18 11:06:30,737 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-18 11:06:30,741 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,746 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,807 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-18 11:06:30,808 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-18 11:06:30,808 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-18 11:06:30,808 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-18 11:06:30,816 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,816 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,818 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,819 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,824 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,831 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,833 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... [2018-11-18 11:06:30,836 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-18 11:06:30,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-18 11:06:30,836 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-18 11:06:30,836 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-18 11:06:30,837 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:30,876 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-18 11:06:30,876 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-18 11:06:31,294 INFO L278 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-18 11:06:31,294 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:06:31 BoogieIcfgContainer [2018-11-18 11:06:31,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-18 11:06:31,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-18 11:06:31,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-18 11:06:31,297 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-18 11:06:31,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:06:31,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 18.11 11:06:30" (1/3) ... [2018-11-18 11:06:31,298 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66cc9b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:06:31, skipping insertion in model container [2018-11-18 11:06:31,298 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:06:31,298 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.11 11:06:30" (2/3) ... [2018-11-18 11:06:31,299 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@66cc9b42 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 18.11 11:06:31, skipping insertion in model container [2018-11-18 11:06:31,299 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-18 11:06:31,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:06:31" (3/3) ... [2018-11-18 11:06:31,300 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu_true-unreach-call_false-termination.cil.c [2018-11-18 11:06:31,332 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-18 11:06:31,332 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-18 11:06:31,332 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-18 11:06:31,333 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-18 11:06:31,333 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-18 11:06:31,333 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-18 11:06:31,333 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-18 11:06:31,333 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-18 11:06:31,333 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-18 11:06:31,345 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states. [2018-11-18 11:06:31,367 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 159 [2018-11-18 11:06:31,368 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,368 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,374 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,374 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,374 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-18 11:06:31,374 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 196 states. [2018-11-18 11:06:31,378 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 159 [2018-11-18 11:06:31,378 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,378 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,379 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,379 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,384 INFO L794 eck$LassoCheckResult]: Stem: 82#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 171#L603true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 137#L288true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 52#L295true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 50#L295-2true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 177#L300-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 187#L305-1true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 145#L414true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 60#L108true assume !(1 == ~P_1_pc~0); 54#L108-2true is_P_1_triggered_~__retres1~0 := 0; 61#L119true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 19#L120true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 193#L481true assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 195#L481-2true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 78#L176true assume 1 == ~P_2_pc~0; 156#L177true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 79#L187true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 157#L188true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 111#L489true assume !(0 != activate_threads_~tmp___0~1); 118#L489-2true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 121#L258true assume 1 == ~C_1_pc~0; 72#L259true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 44#L279true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 124#L280true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 139#L497true assume !(0 != activate_threads_~tmp___1~1); 141#L497-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 45#L422true assume { :end_inline_reset_delta_events } true; 161#L551-3true [2018-11-18 11:06:31,384 INFO L796 eck$LassoCheckResult]: Loop: 161#L551-3true assume true; 166#L551-1true assume !false; 138#L552true start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 128#L387true assume !true; 146#L403true assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 136#L288-1true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 147#L414-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 28#L108-6true assume !(1 == ~P_1_pc~0); 48#L108-8true is_P_1_triggered_~__retres1~0 := 0; 57#L119-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 12#L120-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 186#L481-6true assume !(0 != activate_threads_~tmp~1); 178#L481-8true assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 81#L176-6true assume !(1 == ~P_2_pc~0); 66#L176-8true is_P_2_triggered_~__retres1~1 := 0; 88#L187-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 153#L188-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 103#L489-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 106#L489-8true assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 90#L258-6true assume 1 == ~C_1_pc~0; 68#L259-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 39#L279-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 117#L280-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 133#L497-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 196#L497-8true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 47#L422-1true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13#L318-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 102#L335-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 75#L336-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 173#L570true assume !(0 == start_simulation_~tmp~3); 167#L570-2true assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17#L318-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 104#L335-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 63#L336-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 191#L525true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 38#L532true stop_simulation_#res := stop_simulation_~__retres2~0; 3#L533true start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 98#L583true assume !(0 != start_simulation_~tmp___0~2); 161#L551-3true [2018-11-18 11:06:31,388 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,388 INFO L82 PathProgramCache]: Analyzing trace with hash 1332213672, now seen corresponding path program 1 times [2018-11-18 11:06:31,389 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,389 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,488 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,488 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:31,491 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:31,492 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,492 INFO L82 PathProgramCache]: Analyzing trace with hash 20269596, now seen corresponding path program 1 times [2018-11-18 11:06:31,492 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,492 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,493 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,493 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,501 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,501 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:06:31,502 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:31,511 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:31,512 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:31,513 INFO L87 Difference]: Start difference. First operand 196 states. Second operand 3 states. [2018-11-18 11:06:31,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:31,537 INFO L93 Difference]: Finished difference Result 192 states and 275 transitions. [2018-11-18 11:06:31,538 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:31,540 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 192 states and 275 transitions. [2018-11-18 11:06:31,543 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-18 11:06:31,548 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 192 states to 184 states and 267 transitions. [2018-11-18 11:06:31,548 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-18 11:06:31,549 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-18 11:06:31,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 267 transitions. [2018-11-18 11:06:31,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:31,551 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-18 11:06:31,561 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 267 transitions. [2018-11-18 11:06:31,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-18 11:06:31,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 11:06:31,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 267 transitions. [2018-11-18 11:06:31,577 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-18 11:06:31,577 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 267 transitions. [2018-11-18 11:06:31,578 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-18 11:06:31,578 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 267 transitions. [2018-11-18 11:06:31,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-18 11:06:31,580 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,580 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,581 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,581 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,581 INFO L794 eck$LassoCheckResult]: Stem: 556#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 419#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 420#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 433#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 434#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 530#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 531#L300-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 557#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 479#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 480#L108 assume !(1 == ~P_1_pc~0); 458#L108-2 is_P_1_triggered_~__retres1~0 := 0; 457#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 459#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 460#L481 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 574#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 554#L176 assume 1 == ~P_2_pc~0; 500#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 501#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 503#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 504#L489 assume !(0 != activate_threads_~tmp___0~1); 576#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 580#L258 assume 1 == ~C_1_pc~0; 548#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 512#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 515#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 454#L497 assume !(0 != activate_threads_~tmp___1~1); 455#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 469#L422 assume { :end_inline_reset_delta_events } true; 516#L551-3 [2018-11-18 11:06:31,581 INFO L796 eck$LassoCheckResult]: Loop: 516#L551-3 assume true; 526#L551-1 assume !false; 440#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 401#L387 assume true; 402#L347-1 assume !false; 483#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 428#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 429#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 550#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 551#L352 assume !(0 != eval_~tmp___2~0); 481#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 421#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 422#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 482#L108-6 assume 1 == ~P_1_pc~0; 435#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 436#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 441#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 442#L481-6 assume !(0 != activate_threads_~tmp~1); 559#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 555#L176-6 assume 1 == ~P_2_pc~0; 488#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 489#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 491#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 492#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 573#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 562#L258-6 assume 1 == ~C_1_pc~0; 543#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 474#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 510#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 409#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 410#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 517#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 443#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 444#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 553#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 552#L570 assume !(0 == start_simulation_~tmp~3); 529#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 451#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 452#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 538#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 539#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 509#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 411#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 412#L583 assume !(0 != start_simulation_~tmp___0~2); 516#L551-3 [2018-11-18 11:06:31,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1466227178, now seen corresponding path program 1 times [2018-11-18 11:06:31,582 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,582 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,619 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,619 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,619 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:31,620 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:31,620 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,620 INFO L82 PathProgramCache]: Analyzing trace with hash 1288797641, now seen corresponding path program 1 times [2018-11-18 11:06:31,620 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,620 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,620 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,621 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,666 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,667 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:31,667 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:31,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:31,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:31,668 INFO L87 Difference]: Start difference. First operand 184 states and 267 transitions. cyclomatic complexity: 84 Second operand 3 states. [2018-11-18 11:06:31,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:31,678 INFO L93 Difference]: Finished difference Result 184 states and 266 transitions. [2018-11-18 11:06:31,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:31,679 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 184 states and 266 transitions. [2018-11-18 11:06:31,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-18 11:06:31,682 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 184 states to 184 states and 266 transitions. [2018-11-18 11:06:31,682 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 184 [2018-11-18 11:06:31,682 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 184 [2018-11-18 11:06:31,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 184 states and 266 transitions. [2018-11-18 11:06:31,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:31,683 INFO L705 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-18 11:06:31,683 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states and 266 transitions. [2018-11-18 11:06:31,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 184. [2018-11-18 11:06:31,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 184 states. [2018-11-18 11:06:31,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 266 transitions. [2018-11-18 11:06:31,689 INFO L728 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-18 11:06:31,689 INFO L608 BuchiCegarLoop]: Abstraction has 184 states and 266 transitions. [2018-11-18 11:06:31,689 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-18 11:06:31,689 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 184 states and 266 transitions. [2018-11-18 11:06:31,690 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 151 [2018-11-18 11:06:31,690 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,690 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,691 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,692 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,692 INFO L794 eck$LassoCheckResult]: Stem: 933#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 797#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 808#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 809#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 905#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 906#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 934#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 856#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 857#L108 assume !(1 == ~P_1_pc~0); 835#L108-2 is_P_1_triggered_~__retres1~0 := 0; 834#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 836#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 837#L481 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 951#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 931#L176 assume 1 == ~P_2_pc~0; 877#L177 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 878#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 880#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 881#L489 assume !(0 != activate_threads_~tmp___0~1); 953#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 957#L258 assume 1 == ~C_1_pc~0; 925#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 889#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 892#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 831#L497 assume !(0 != activate_threads_~tmp___1~1); 832#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 844#L422 assume { :end_inline_reset_delta_events } true; 893#L551-3 [2018-11-18 11:06:31,692 INFO L796 eck$LassoCheckResult]: Loop: 893#L551-3 assume true; 901#L551-1 assume !false; 812#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 778#L387 assume true; 779#L347-1 assume !false; 860#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 803#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 804#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 927#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 928#L352 assume !(0 != eval_~tmp___2~0); 858#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 798#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 799#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 859#L108-6 assume 1 == ~P_1_pc~0; 813#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 814#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 818#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 819#L481-6 assume !(0 != activate_threads_~tmp~1); 936#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 932#L176-6 assume 1 == ~P_2_pc~0; 865#L177-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 866#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 868#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 869#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 950#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 939#L258-6 assume 1 == ~C_1_pc~0; 920#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 851#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 887#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 786#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 787#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 894#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 820#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 821#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 930#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 929#L570 assume !(0 == start_simulation_~tmp~3); 904#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 828#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 829#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 915#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 916#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 886#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 788#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 789#L583 assume !(0 != start_simulation_~tmp___0~2); 893#L551-3 [2018-11-18 11:06:31,692 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,693 INFO L82 PathProgramCache]: Analyzing trace with hash 1247372460, now seen corresponding path program 1 times [2018-11-18 11:06:31,693 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,693 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,723 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,723 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:31,724 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:31,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,724 INFO L82 PathProgramCache]: Analyzing trace with hash 1288797641, now seen corresponding path program 2 times [2018-11-18 11:06:31,724 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,724 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,760 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,760 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:31,761 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:31,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:31,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:31,761 INFO L87 Difference]: Start difference. First operand 184 states and 266 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-18 11:06:31,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:31,805 INFO L93 Difference]: Finished difference Result 331 states and 474 transitions. [2018-11-18 11:06:31,805 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:31,805 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 331 states and 474 transitions. [2018-11-18 11:06:31,807 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 299 [2018-11-18 11:06:31,808 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 331 states to 331 states and 474 transitions. [2018-11-18 11:06:31,808 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 331 [2018-11-18 11:06:31,809 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 331 [2018-11-18 11:06:31,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 331 states and 474 transitions. [2018-11-18 11:06:31,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:31,810 INFO L705 BuchiCegarLoop]: Abstraction has 331 states and 474 transitions. [2018-11-18 11:06:31,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 331 states and 474 transitions. [2018-11-18 11:06:31,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 331 to 315. [2018-11-18 11:06:31,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2018-11-18 11:06:31,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 452 transitions. [2018-11-18 11:06:31,818 INFO L728 BuchiCegarLoop]: Abstraction has 315 states and 452 transitions. [2018-11-18 11:06:31,818 INFO L608 BuchiCegarLoop]: Abstraction has 315 states and 452 transitions. [2018-11-18 11:06:31,818 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-18 11:06:31,818 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 315 states and 452 transitions. [2018-11-18 11:06:31,819 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 283 [2018-11-18 11:06:31,819 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,819 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,820 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,820 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,820 INFO L794 eck$LassoCheckResult]: Stem: 1459#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 1322#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1323#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 1334#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1335#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1428#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1429#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1460#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1380#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1381#L108 assume !(1 == ~P_1_pc~0); 1359#L108-2 is_P_1_triggered_~__retres1~0 := 0; 1358#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1360#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1361#L481 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 1479#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1454#L176 assume !(1 == ~P_2_pc~0); 1455#L176-2 is_P_2_triggered_~__retres1~1 := 0; 1456#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1401#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1402#L489 assume !(0 != activate_threads_~tmp___0~1); 1481#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1485#L258 assume 1 == ~C_1_pc~0; 1450#L259 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1410#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1413#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1355#L497 assume !(0 != activate_threads_~tmp___1~1); 1356#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1370#L422 assume { :end_inline_reset_delta_events } true; 1414#L551-3 [2018-11-18 11:06:31,820 INFO L796 eck$LassoCheckResult]: Loop: 1414#L551-3 assume true; 1424#L551-1 assume !false; 1341#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 1300#L387 assume true; 1301#L347-1 assume !false; 1384#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1327#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1328#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1448#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1449#L352 assume !(0 != eval_~tmp___2~0); 1382#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 1320#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 1321#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1383#L108-6 assume 1 == ~P_1_pc~0; 1336#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1337#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1342#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1343#L481-6 assume !(0 != activate_threads_~tmp~1); 1462#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1457#L176-6 assume !(1 == ~P_2_pc~0); 1458#L176-8 is_P_2_triggered_~__retres1~1 := 0; 1612#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1611#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1610#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1609#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1608#L258-6 assume 1 == ~C_1_pc~0; 1602#L259-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1600#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1598#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1597#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1592#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1590#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1583#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1581#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1453#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1452#L570 assume !(0 == start_simulation_~tmp~3); 1427#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1352#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1353#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1436#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1437#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1407#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 1312#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1313#L583 assume !(0 != start_simulation_~tmp___0~2); 1414#L551-3 [2018-11-18 11:06:31,821 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,821 INFO L82 PathProgramCache]: Analyzing trace with hash -31952275, now seen corresponding path program 1 times [2018-11-18 11:06:31,821 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,821 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,822 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:31,822 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,843 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,843 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:31,844 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:31,844 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,844 INFO L82 PathProgramCache]: Analyzing trace with hash -768806390, now seen corresponding path program 1 times [2018-11-18 11:06:31,844 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,844 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,845 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,845 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:31,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:31,887 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:31,887 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:31,888 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:31,888 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:31,888 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:31,888 INFO L87 Difference]: Start difference. First operand 315 states and 452 transitions. cyclomatic complexity: 138 Second operand 3 states. [2018-11-18 11:06:31,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:31,951 INFO L93 Difference]: Finished difference Result 586 states and 822 transitions. [2018-11-18 11:06:31,952 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:31,952 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 586 states and 822 transitions. [2018-11-18 11:06:31,954 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 556 [2018-11-18 11:06:31,956 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 586 states to 586 states and 822 transitions. [2018-11-18 11:06:31,956 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 586 [2018-11-18 11:06:31,956 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 586 [2018-11-18 11:06:31,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 586 states and 822 transitions. [2018-11-18 11:06:31,957 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:31,957 INFO L705 BuchiCegarLoop]: Abstraction has 586 states and 822 transitions. [2018-11-18 11:06:31,958 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states and 822 transitions. [2018-11-18 11:06:31,969 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 570. [2018-11-18 11:06:31,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 570 states. [2018-11-18 11:06:31,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 570 states to 570 states and 802 transitions. [2018-11-18 11:06:31,971 INFO L728 BuchiCegarLoop]: Abstraction has 570 states and 802 transitions. [2018-11-18 11:06:31,971 INFO L608 BuchiCegarLoop]: Abstraction has 570 states and 802 transitions. [2018-11-18 11:06:31,971 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-18 11:06:31,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 570 states and 802 transitions. [2018-11-18 11:06:31,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 540 [2018-11-18 11:06:31,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:31,974 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:31,975 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,975 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:31,975 INFO L794 eck$LassoCheckResult]: Stem: 2378#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 2230#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2231#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 2242#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2243#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2339#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2340#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2379#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2291#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2292#L108 assume !(1 == ~P_1_pc~0); 2269#L108-2 is_P_1_triggered_~__retres1~0 := 0; 2268#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2270#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2271#L481 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 2406#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2373#L176 assume !(1 == ~P_2_pc~0); 2374#L176-2 is_P_2_triggered_~__retres1~1 := 0; 2375#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2312#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2313#L489 assume !(0 != activate_threads_~tmp___0~1); 2412#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2418#L258 assume !(1 == ~C_1_pc~0); 2414#L258-2 assume !(2 == ~C_1_pc~0); 2320#L268-1 is_C_1_triggered_~__retres1~2 := 0; 2321#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2326#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2265#L497 assume !(0 != activate_threads_~tmp___1~1); 2266#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2279#L422 assume { :end_inline_reset_delta_events } true; 2327#L551-3 [2018-11-18 11:06:31,976 INFO L796 eck$LassoCheckResult]: Loop: 2327#L551-3 assume true; 2335#L551-1 assume !false; 2246#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 2212#L387 assume true; 2213#L347-1 assume !false; 2295#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2239#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2240#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2368#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2369#L352 assume !(0 != eval_~tmp___2~0); 2293#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 2232#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 2233#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2294#L108-6 assume 1 == ~P_1_pc~0; 2247#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2248#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2255#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2256#L481-6 assume !(0 != activate_threads_~tmp~1); 2385#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2376#L176-6 assume !(1 == ~P_2_pc~0); 2377#L176-8 is_P_2_triggered_~__retres1~1 := 0; 2381#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2303#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2304#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2403#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2387#L258-6 assume !(1 == ~C_1_pc~0); 2382#L258-8 assume !(2 == ~C_1_pc~0); 2383#L268-5 is_C_1_triggered_~__retres1~2 := 0; 2755#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2753#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2751#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2749#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2747#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2743#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2742#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2741#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2740#L570 assume !(0 == start_simulation_~tmp~3); 2338#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2260#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2261#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2353#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2354#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2318#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 2222#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2223#L583 assume !(0 != start_simulation_~tmp___0~2); 2327#L551-3 [2018-11-18 11:06:31,976 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:31,976 INFO L82 PathProgramCache]: Analyzing trace with hash -1307353874, now seen corresponding path program 1 times [2018-11-18 11:06:31,976 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:31,976 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,977 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:31,977 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:31,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,034 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,034 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,034 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:32,035 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:32,035 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,035 INFO L82 PathProgramCache]: Analyzing trace with hash 261148921, now seen corresponding path program 1 times [2018-11-18 11:06:32,035 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,035 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,036 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,036 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,057 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,057 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:32,058 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:32,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:32,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:32,058 INFO L87 Difference]: Start difference. First operand 570 states and 802 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-18 11:06:32,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:32,148 INFO L93 Difference]: Finished difference Result 1575 states and 2191 transitions. [2018-11-18 11:06:32,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:32,149 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1575 states and 2191 transitions. [2018-11-18 11:06:32,158 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1512 [2018-11-18 11:06:32,166 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1575 states to 1575 states and 2191 transitions. [2018-11-18 11:06:32,166 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1575 [2018-11-18 11:06:32,167 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1575 [2018-11-18 11:06:32,168 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1575 states and 2191 transitions. [2018-11-18 11:06:32,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:32,170 INFO L705 BuchiCegarLoop]: Abstraction has 1575 states and 2191 transitions. [2018-11-18 11:06:32,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1575 states and 2191 transitions. [2018-11-18 11:06:32,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1575 to 609. [2018-11-18 11:06:32,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 609 states. [2018-11-18 11:06:32,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 609 states to 609 states and 841 transitions. [2018-11-18 11:06:32,186 INFO L728 BuchiCegarLoop]: Abstraction has 609 states and 841 transitions. [2018-11-18 11:06:32,186 INFO L608 BuchiCegarLoop]: Abstraction has 609 states and 841 transitions. [2018-11-18 11:06:32,186 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-18 11:06:32,186 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 609 states and 841 transitions. [2018-11-18 11:06:32,189 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 576 [2018-11-18 11:06:32,189 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:32,189 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:32,190 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,190 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,190 INFO L794 eck$LassoCheckResult]: Stem: 4552#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 4390#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4391#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 4402#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 4403#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 4515#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 4516#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4553#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 4451#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4452#L108 assume !(1 == ~P_1_pc~0); 4429#L108-2 is_P_1_triggered_~__retres1~0 := 0; 4525#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4529#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4581#L481 assume !(0 != activate_threads_~tmp~1); 4582#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4547#L176 assume !(1 == ~P_2_pc~0); 4548#L176-2 is_P_2_triggered_~__retres1~1 := 0; 4549#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4475#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4476#L489 assume !(0 != activate_threads_~tmp___0~1); 4586#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4591#L258 assume !(1 == ~C_1_pc~0); 4588#L258-2 assume !(2 == ~C_1_pc~0); 4488#L268-1 is_C_1_triggered_~__retres1~2 := 0; 4489#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4495#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4425#L497 assume !(0 != activate_threads_~tmp___1~1); 4426#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4439#L422 assume { :end_inline_reset_delta_events } true; 4496#L551-3 [2018-11-18 11:06:32,190 INFO L796 eck$LassoCheckResult]: Loop: 4496#L551-3 assume true; 4834#L551-1 assume !false; 4827#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 4823#L387 assume true; 4821#L347-1 assume !false; 4818#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4733#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 4730#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4719#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 4714#L352 assume !(0 != eval_~tmp___2~0); 4453#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 4392#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 4393#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4454#L108-6 assume 1 == ~P_1_pc~0; 4407#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 4408#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 4890#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 4891#L481-6 assume !(0 != activate_threads_~tmp~1); 4556#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4550#L176-6 assume !(1 == ~P_2_pc~0); 4551#L176-8 is_P_2_triggered_~__retres1~1 := 0; 4961#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4959#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4957#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 4955#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4953#L258-6 assume !(1 == ~C_1_pc~0); 4951#L258-8 assume !(2 == ~C_1_pc~0); 4949#L268-5 is_C_1_triggered_~__retres1~2 := 0; 4947#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 4945#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4943#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 4941#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 4939#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4934#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 4933#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4929#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 4544#L570 assume !(0 == start_simulation_~tmp~3); 4514#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 4420#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 4421#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 4851#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 4850#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 4485#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 4486#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 4840#L583 assume !(0 != start_simulation_~tmp___0~2); 4496#L551-3 [2018-11-18 11:06:32,191 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,191 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 1 times [2018-11-18 11:06:32,191 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,191 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,192 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,192 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,218 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,219 INFO L82 PathProgramCache]: Analyzing trace with hash 261148921, now seen corresponding path program 2 times [2018-11-18 11:06:32,219 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,219 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,220 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,220 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,246 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,246 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,247 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:32,247 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:32,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:32,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:32,247 INFO L87 Difference]: Start difference. First operand 609 states and 841 transitions. cyclomatic complexity: 233 Second operand 5 states. [2018-11-18 11:06:32,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:32,320 INFO L93 Difference]: Finished difference Result 1075 states and 1473 transitions. [2018-11-18 11:06:32,321 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-18 11:06:32,321 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1075 states and 1473 transitions. [2018-11-18 11:06:32,325 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1042 [2018-11-18 11:06:32,328 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1075 states to 1075 states and 1473 transitions. [2018-11-18 11:06:32,328 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1075 [2018-11-18 11:06:32,328 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1075 [2018-11-18 11:06:32,329 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1075 states and 1473 transitions. [2018-11-18 11:06:32,330 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:32,330 INFO L705 BuchiCegarLoop]: Abstraction has 1075 states and 1473 transitions. [2018-11-18 11:06:32,330 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1075 states and 1473 transitions. [2018-11-18 11:06:32,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1075 to 621. [2018-11-18 11:06:32,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 621 states. [2018-11-18 11:06:32,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 621 states to 621 states and 853 transitions. [2018-11-18 11:06:32,338 INFO L728 BuchiCegarLoop]: Abstraction has 621 states and 853 transitions. [2018-11-18 11:06:32,338 INFO L608 BuchiCegarLoop]: Abstraction has 621 states and 853 transitions. [2018-11-18 11:06:32,338 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-18 11:06:32,338 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 621 states and 853 transitions. [2018-11-18 11:06:32,340 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 588 [2018-11-18 11:06:32,340 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:32,340 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:32,341 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,341 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,341 INFO L794 eck$LassoCheckResult]: Stem: 6242#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 6090#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 6091#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 6102#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6103#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 6202#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 6203#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 6243#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6150#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6151#L108 assume !(1 == ~P_1_pc~0); 6129#L108-2 is_P_1_triggered_~__retres1~0 := 0; 6213#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6286#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6266#L481 assume !(0 != activate_threads_~tmp~1); 6267#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6238#L176 assume !(1 == ~P_2_pc~0); 6239#L176-2 is_P_2_triggered_~__retres1~1 := 0; 6240#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6174#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6175#L489 assume !(0 != activate_threads_~tmp___0~1); 6272#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6280#L258 assume !(1 == ~C_1_pc~0); 6276#L258-2 assume !(2 == ~C_1_pc~0); 6185#L268-1 is_C_1_triggered_~__retres1~2 := 0; 6186#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6189#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6125#L497 assume !(0 != activate_threads_~tmp___1~1); 6126#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6138#L422 assume { :end_inline_reset_delta_events } true; 6190#L551-3 [2018-11-18 11:06:32,341 INFO L796 eck$LassoCheckResult]: Loop: 6190#L551-3 assume true; 6199#L551-1 assume !false; 6106#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 6070#L387 assume true; 6071#L347-1 assume !false; 6154#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6097#L318 assume !(0 == ~P_1_st~0); 6099#L322 assume !(0 == ~P_2_st~0); 6155#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 6156#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6285#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 6416#L352 assume !(0 != eval_~tmp___2~0); 6152#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 6092#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 6093#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 6153#L108-6 assume !(1 == ~P_1_pc~0); 6172#L108-8 is_P_1_triggered_~__retres1~0 := 0; 6326#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 6320#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 6314#L481-6 assume !(0 != activate_threads_~tmp~1); 6246#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 6241#L176-6 assume !(1 == ~P_2_pc~0); 6221#L176-8 is_P_2_triggered_~__retres1~1 := 0; 6222#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 6163#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 6164#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 6268#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 6269#L258-6 assume !(1 == ~C_1_pc~0); 6247#L258-8 assume !(2 == ~C_1_pc~0); 6144#L268-5 is_C_1_triggered_~__retres1~2 := 0; 6145#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 6184#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 6080#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 6081#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6191#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6114#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6115#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6236#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 6235#L570 assume !(0 == start_simulation_~tmp~3); 6206#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 6122#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 6123#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 6215#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 6216#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 6183#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 6082#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 6083#L583 assume !(0 != start_simulation_~tmp___0~2); 6190#L551-3 [2018-11-18 11:06:32,341 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,342 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 2 times [2018-11-18 11:06:32,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,342 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:32,343 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2011966143, now seen corresponding path program 1 times [2018-11-18 11:06:32,358 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,358 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,358 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:32,359 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,376 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:32,376 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:32,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:32,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:32,376 INFO L87 Difference]: Start difference. First operand 621 states and 853 transitions. cyclomatic complexity: 233 Second operand 3 states. [2018-11-18 11:06:32,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:32,416 INFO L93 Difference]: Finished difference Result 1081 states and 1463 transitions. [2018-11-18 11:06:32,416 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:32,417 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1081 states and 1463 transitions. [2018-11-18 11:06:32,422 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1048 [2018-11-18 11:06:32,425 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1081 states to 1081 states and 1463 transitions. [2018-11-18 11:06:32,425 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1081 [2018-11-18 11:06:32,425 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1081 [2018-11-18 11:06:32,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1081 states and 1463 transitions. [2018-11-18 11:06:32,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:32,427 INFO L705 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-18 11:06:32,428 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1081 states and 1463 transitions. [2018-11-18 11:06:32,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1081 to 1081. [2018-11-18 11:06:32,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1081 states. [2018-11-18 11:06:32,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1081 states to 1081 states and 1463 transitions. [2018-11-18 11:06:32,438 INFO L728 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-18 11:06:32,438 INFO L608 BuchiCegarLoop]: Abstraction has 1081 states and 1463 transitions. [2018-11-18 11:06:32,438 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-18 11:06:32,439 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1081 states and 1463 transitions. [2018-11-18 11:06:32,442 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1048 [2018-11-18 11:06:32,442 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:32,442 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:32,443 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,443 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,443 INFO L794 eck$LassoCheckResult]: Stem: 7954#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 7798#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7799#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 7809#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7810#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 7913#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 7914#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 7955#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7858#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7859#L108 assume !(1 == ~P_1_pc~0); 7834#L108-2 is_P_1_triggered_~__retres1~0 := 0; 7924#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 7999#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 7977#L481 assume !(0 != activate_threads_~tmp~1); 7978#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7949#L176 assume !(1 == ~P_2_pc~0); 7950#L176-2 is_P_2_triggered_~__retres1~1 := 0; 7951#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7882#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7883#L489 assume !(0 != activate_threads_~tmp___0~1); 7983#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7993#L258 assume !(1 == ~C_1_pc~0); 7988#L258-2 assume !(2 == ~C_1_pc~0); 7893#L268-1 is_C_1_triggered_~__retres1~2 := 0; 7894#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 7899#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7830#L497 assume !(0 != activate_threads_~tmp___1~1); 7831#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7844#L422 assume { :end_inline_reset_delta_events } true; 7900#L551-3 [2018-11-18 11:06:32,444 INFO L796 eck$LassoCheckResult]: Loop: 7900#L551-3 assume true; 8168#L551-1 assume !false; 8164#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 8162#L387 assume true; 8161#L347-1 assume !false; 8160#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8158#L318 assume !(0 == ~P_1_st~0); 8159#L322 assume !(0 == ~P_2_st~0); 8258#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 8256#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8254#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8251#L352 assume !(0 != eval_~tmp___2~0); 8249#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 8247#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 8245#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8243#L108-6 assume 1 == ~P_1_pc~0; 8240#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8239#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8238#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8236#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8235#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8233#L176-6 assume !(1 == ~P_2_pc~0); 8231#L176-8 is_P_2_triggered_~__retres1~1 := 0; 8230#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8227#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8225#L489-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 8224#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8223#L258-6 assume !(1 == ~C_1_pc~0); 8222#L258-8 assume !(2 == ~C_1_pc~0); 8220#L268-5 is_C_1_triggered_~__retres1~2 := 0; 8218#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8216#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8212#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8209#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 8208#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8206#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8204#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8201#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8198#L570 assume !(0 == start_simulation_~tmp~3); 8195#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8192#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8190#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8187#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8182#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8180#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 8177#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8172#L583 assume !(0 != start_simulation_~tmp___0~2); 7900#L551-3 [2018-11-18 11:06:32,444 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,444 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 3 times [2018-11-18 11:06:32,444 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,444 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,445 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,445 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,448 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,456 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,456 INFO L82 PathProgramCache]: Analyzing trace with hash 1602464610, now seen corresponding path program 1 times [2018-11-18 11:06:32,456 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,456 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,457 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:32,457 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,539 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,539 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,539 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:32,540 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:32,540 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:32,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:32,540 INFO L87 Difference]: Start difference. First operand 1081 states and 1463 transitions. cyclomatic complexity: 383 Second operand 5 states. [2018-11-18 11:06:32,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:32,603 INFO L93 Difference]: Finished difference Result 2401 states and 3246 transitions. [2018-11-18 11:06:32,603 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:32,603 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2401 states and 3246 transitions. [2018-11-18 11:06:32,610 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2368 [2018-11-18 11:06:32,615 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2401 states to 2401 states and 3246 transitions. [2018-11-18 11:06:32,615 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2401 [2018-11-18 11:06:32,617 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2401 [2018-11-18 11:06:32,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2401 states and 3246 transitions. [2018-11-18 11:06:32,619 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:32,619 INFO L705 BuchiCegarLoop]: Abstraction has 2401 states and 3246 transitions. [2018-11-18 11:06:32,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2401 states and 3246 transitions. [2018-11-18 11:06:32,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2401 to 1117. [2018-11-18 11:06:32,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1117 states. [2018-11-18 11:06:32,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1117 states to 1117 states and 1490 transitions. [2018-11-18 11:06:32,633 INFO L728 BuchiCegarLoop]: Abstraction has 1117 states and 1490 transitions. [2018-11-18 11:06:32,633 INFO L608 BuchiCegarLoop]: Abstraction has 1117 states and 1490 transitions. [2018-11-18 11:06:32,633 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-18 11:06:32,633 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1117 states and 1490 transitions. [2018-11-18 11:06:32,635 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1084 [2018-11-18 11:06:32,636 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:32,636 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:32,636 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,636 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,636 INFO L794 eck$LassoCheckResult]: Stem: 11452#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 11294#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 11295#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 11305#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 11306#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11409#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 11410#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 11453#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 11354#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11355#L108 assume !(1 == ~P_1_pc~0); 11330#L108-2 is_P_1_triggered_~__retres1~0 := 0; 11420#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11496#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11478#L481 assume !(0 != activate_threads_~tmp~1); 11479#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11447#L176 assume !(1 == ~P_2_pc~0); 11448#L176-2 is_P_2_triggered_~__retres1~1 := 0; 11449#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11380#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11381#L489 assume !(0 != activate_threads_~tmp___0~1); 11485#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11493#L258 assume !(1 == ~C_1_pc~0); 11489#L258-2 assume !(2 == ~C_1_pc~0); 11390#L268-1 is_C_1_triggered_~__retres1~2 := 0; 11391#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11395#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11326#L497 assume !(0 != activate_threads_~tmp___1~1); 11327#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11340#L422 assume { :end_inline_reset_delta_events } true; 11396#L551-3 [2018-11-18 11:06:32,637 INFO L796 eck$LassoCheckResult]: Loop: 11396#L551-3 assume true; 11706#L551-1 assume !false; 11703#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 11700#L387 assume true; 11698#L347-1 assume !false; 11697#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11696#L318 assume !(0 == ~P_1_st~0); 11691#L322 assume !(0 == ~P_2_st~0); 11689#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11690#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11625#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11626#L352 assume !(0 != eval_~tmp___2~0); 11667#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 11802#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 11801#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11599#L108-6 assume 1 == ~P_1_pc~0; 11601#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 11799#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11797#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11795#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11758#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11753#L176-6 assume !(1 == ~P_2_pc~0); 11751#L176-8 is_P_2_triggered_~__retres1~1 := 0; 11749#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11747#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11745#L489-6 assume !(0 != activate_threads_~tmp___0~1); 11743#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 11741#L258-6 assume !(1 == ~C_1_pc~0); 11739#L258-8 assume !(2 == ~C_1_pc~0); 11737#L268-5 is_C_1_triggered_~__retres1~2 := 0; 11735#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11733#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11731#L497-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 11729#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 11727#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11724#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11722#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11720#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11717#L570 assume !(0 == start_simulation_~tmp~3); 11715#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11713#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11712#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11711#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11710#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11709#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 11708#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11707#L583 assume !(0 != start_simulation_~tmp___0~2); 11396#L551-3 [2018-11-18 11:06:32,637 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,637 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 4 times [2018-11-18 11:06:32,637 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,637 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,638 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,638 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,644 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,647 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,647 INFO L82 PathProgramCache]: Analyzing trace with hash 1821319328, now seen corresponding path program 1 times [2018-11-18 11:06:32,648 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,648 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,648 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:32,648 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,692 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,692 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,692 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-18 11:06:32,692 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:32,692 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-18 11:06:32,692 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-18 11:06:32,692 INFO L87 Difference]: Start difference. First operand 1117 states and 1490 transitions. cyclomatic complexity: 374 Second operand 5 states. [2018-11-18 11:06:32,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:32,761 INFO L93 Difference]: Finished difference Result 2371 states and 3163 transitions. [2018-11-18 11:06:32,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-18 11:06:32,762 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2371 states and 3163 transitions. [2018-11-18 11:06:32,768 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2338 [2018-11-18 11:06:32,773 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2371 states to 2371 states and 3163 transitions. [2018-11-18 11:06:32,773 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2371 [2018-11-18 11:06:32,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2371 [2018-11-18 11:06:32,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2371 states and 3163 transitions. [2018-11-18 11:06:32,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:32,776 INFO L705 BuchiCegarLoop]: Abstraction has 2371 states and 3163 transitions. [2018-11-18 11:06:32,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2371 states and 3163 transitions. [2018-11-18 11:06:32,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2371 to 1147. [2018-11-18 11:06:32,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-11-18 11:06:32,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1509 transitions. [2018-11-18 11:06:32,790 INFO L728 BuchiCegarLoop]: Abstraction has 1147 states and 1509 transitions. [2018-11-18 11:06:32,790 INFO L608 BuchiCegarLoop]: Abstraction has 1147 states and 1509 transitions. [2018-11-18 11:06:32,790 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-18 11:06:32,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1147 states and 1509 transitions. [2018-11-18 11:06:32,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-18 11:06:32,793 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:32,793 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:32,794 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,794 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:32,794 INFO L794 eck$LassoCheckResult]: Stem: 14955#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 14796#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 14797#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 14807#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 14808#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 14909#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 14910#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 14956#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14854#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 14855#L108 assume !(1 == ~P_1_pc~0); 14832#L108-2 is_P_1_triggered_~__retres1~0 := 0; 14921#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15005#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 14987#L481 assume !(0 != activate_threads_~tmp~1); 14988#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 14949#L176 assume !(1 == ~P_2_pc~0); 14950#L176-2 is_P_2_triggered_~__retres1~1 := 0; 14951#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 14879#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 14880#L489 assume !(0 != activate_threads_~tmp___0~1); 14994#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15001#L258 assume !(1 == ~C_1_pc~0); 14997#L258-2 assume !(2 == ~C_1_pc~0); 14890#L268-1 is_C_1_triggered_~__retres1~2 := 0; 14891#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 14895#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 14828#L497 assume !(0 != activate_threads_~tmp___1~1); 14829#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 14841#L422 assume { :end_inline_reset_delta_events } true; 14896#L551-3 [2018-11-18 11:06:32,794 INFO L796 eck$LassoCheckResult]: Loop: 14896#L551-3 assume true; 15301#L551-1 assume !false; 15299#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 15180#L387 assume true; 15296#L347-1 assume !false; 15294#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15291#L318 assume !(0 == ~P_1_st~0); 15292#L322 assume !(0 == ~P_2_st~0); 15530#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 15487#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15466#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 15443#L352 assume !(0 != eval_~tmp___2~0); 15434#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 15429#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 15428#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15427#L108-6 assume 1 == ~P_1_pc~0; 15424#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 15422#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15420#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15418#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 15416#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15414#L176-6 assume !(1 == ~P_2_pc~0); 15412#L176-8 is_P_2_triggered_~__retres1~1 := 0; 15410#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15379#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15348#L489-6 assume !(0 != activate_threads_~tmp___0~1); 15338#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15336#L258-6 assume !(1 == ~C_1_pc~0); 15334#L258-8 assume !(2 == ~C_1_pc~0); 15332#L268-5 is_C_1_triggered_~__retres1~2 := 0; 15330#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15328#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15326#L497-6 assume !(0 != activate_threads_~tmp___1~1); 15324#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 15322#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15319#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15317#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15315#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 15312#L570 assume !(0 == start_simulation_~tmp~3); 15310#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 15308#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 15307#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 15306#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 15305#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 15304#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 15303#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 15302#L583 assume !(0 != start_simulation_~tmp___0~2); 14896#L551-3 [2018-11-18 11:06:32,795 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,795 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 5 times [2018-11-18 11:06:32,795 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,795 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,795 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,796 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,796 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,805 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,805 INFO L82 PathProgramCache]: Analyzing trace with hash 541455650, now seen corresponding path program 1 times [2018-11-18 11:06:32,805 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,805 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,806 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:32,806 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:32,817 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:32,817 INFO L82 PathProgramCache]: Analyzing trace with hash 1807088919, now seen corresponding path program 1 times [2018-11-18 11:06:32,817 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:32,817 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:32,817 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:32,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:32,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:32,849 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:32,849 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:32,849 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:32,972 WARN L180 SmtUtils]: Spent 118.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-18 11:06:33,022 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:06:33,023 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:06:33,023 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:06:33,023 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:06:33,023 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-18 11:06:33,023 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,024 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:06:33,024 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:06:33,024 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 11:06:33,024 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:06:33,024 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:06:33,040 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,060 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,062 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,067 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,068 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,072 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,073 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,075 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,077 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,078 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,080 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,081 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,090 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,093 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,095 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,098 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,100 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,108 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,277 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:06:33,277 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 2 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 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,282 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,282 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,289 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,289 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Honda state: {ULTIMATE.start_exists_runnable_thread_~__retres1~3=1, ULTIMATE.start_stop_simulation_~tmp~2=1, ULTIMATE.start_exists_runnable_thread_#res=1} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2018-11-18 11:06:33,321 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,321 INFO L163 nArgumentSynthesizer]: Using integer mode. Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,338 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,339 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~ret1=0} Honda state: {ULTIMATE.start_eval_#t~ret1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 4 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 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,367 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,367 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,374 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,375 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret10=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret10=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 5 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 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,392 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,392 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,398 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,398 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___0~0=0} Honda state: {ULTIMATE.start_eval_~tmp___0~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 6 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 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,424 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,424 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,430 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,430 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_#t~ret9=0} Honda state: {ULTIMATE.start_start_simulation_#t~ret9=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 7 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 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,452 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,452 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,454 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,454 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret5=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret5=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 8 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 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,475 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,475 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,482 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,482 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_pc~0=4} Honda state: {~P_2_pc~0=4} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 9 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 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,502 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,502 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_~tmp___1~0=0} Honda state: {ULTIMATE.start_eval_~tmp___1~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 10 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 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,534 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,534 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret8=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 11 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 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,552 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,552 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,555 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,555 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet4=0} Honda state: {ULTIMATE.start_eval_#t~nondet4=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 12 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 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,573 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,573 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,578 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,578 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_#t~ret7=0} Honda state: {ULTIMATE.start_activate_threads_#t~ret7=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 13 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 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,596 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,596 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,598 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,598 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet2=0} Honda state: {ULTIMATE.start_eval_#t~nondet2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 14 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 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,625 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,625 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,630 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,630 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~P_2_st~0=7} Honda state: {~P_2_st~0=7} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 15 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 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,659 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,659 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,661 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,661 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_eval_#t~nondet3=0} Honda state: {ULTIMATE.start_eval_#t~nondet3=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 16 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 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,687 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,687 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,691 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-18 11:06:33,691 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {ULTIMATE.start_activate_threads_~tmp___0~1=0, ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 17 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 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,716 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-18 11:06:33,716 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/z3 Starting monitored process 18 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 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,744 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-18 11:06:33,744 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-18 11:06:33,777 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-18 11:06:33,779 INFO L216 LassoAnalysis]: Preferences: [2018-11-18 11:06:33,779 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-18 11:06:33,779 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-18 11:06:33,779 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-18 11:06:33,779 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-18 11:06:33,779 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-18 11:06:33,779 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-18 11:06:33,779 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-18 11:06:33,779 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu_true-unreach-call_false-termination.cil.c_Iteration10_Loop [2018-11-18 11:06:33,779 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-18 11:06:33,779 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-18 11:06:33,781 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,787 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,792 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,796 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,798 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,799 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,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-18 11:06:33,817 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,822 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,829 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,842 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,846 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,848 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,850 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,854 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,859 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,861 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,862 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,867 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,872 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:33,897 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-18 11:06:34,054 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-18 11:06:34,058 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-18 11:06:34,060 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,063 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,066 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,067 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,067 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,069 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,070 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,072 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,073 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,073 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,073 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,075 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,075 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,076 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,077 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,077 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,077 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,077 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,077 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,077 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,078 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,078 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,079 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,080 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,081 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,081 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,081 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,082 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,082 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,083 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,083 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,083 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,083 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,083 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,083 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,084 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,084 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,085 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,085 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,085 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,085 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,086 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,087 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,088 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,088 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,089 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,090 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,091 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,091 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,092 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,093 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,093 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,093 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,094 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,095 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,095 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,096 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,097 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,097 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,098 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,098 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,100 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,101 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,102 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,103 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,103 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,104 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,104 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,106 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,106 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,106 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,106 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,107 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,108 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,108 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,108 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,109 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,110 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,111 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,111 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,111 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,111 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,113 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,113 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,113 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,114 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,114 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,115 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,115 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,115 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,115 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,116 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,116 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,117 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,118 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,118 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,119 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,120 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,120 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,121 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,122 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,123 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,126 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,126 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,126 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,127 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,127 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,128 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,128 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,129 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,129 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,131 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,131 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,132 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-18 11:06:34,132 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-18 11:06:34,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,133 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,133 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-18 11:06:34,133 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,134 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,134 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,134 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,134 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,134 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,134 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,135 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,135 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,136 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,136 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,140 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,141 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,142 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,142 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,143 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,143 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,143 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,144 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,144 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,144 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,145 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,145 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,145 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,145 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,145 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,145 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,146 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,147 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,147 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,147 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,149 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,149 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,150 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,150 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,151 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,151 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,153 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,153 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,153 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,154 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,155 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,155 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,157 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,159 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,159 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,159 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,161 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,161 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,162 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,163 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,163 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,163 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,164 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,165 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,165 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,165 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,166 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,166 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,166 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,166 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,167 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,167 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,167 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,167 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,170 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,171 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,171 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,171 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,171 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,171 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,171 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,172 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,172 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,173 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,173 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,173 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,173 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,173 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,173 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,174 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,174 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,175 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,175 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,175 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,175 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,175 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,176 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,176 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,176 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,177 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,177 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,177 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,178 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,178 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,178 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,180 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,180 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,180 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,180 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,182 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,182 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,184 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,185 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,185 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,185 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,185 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,186 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,187 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,187 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,187 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,187 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,187 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,187 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,189 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,189 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,189 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,189 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,189 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,190 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,190 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,198 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,199 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,199 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,199 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,199 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,199 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,200 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,201 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,202 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,202 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,202 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,202 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,203 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,205 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,205 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,205 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,206 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,206 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,207 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,207 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-18 11:06:34,207 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,207 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,207 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,208 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,208 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,208 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,208 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,208 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,210 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,210 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,210 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,214 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,217 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,218 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,220 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,220 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,221 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,222 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,222 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,223 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,223 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,223 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,223 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,224 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,224 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,224 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,229 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,230 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,231 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,232 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,232 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,232 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,234 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,234 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,236 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,236 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,237 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,237 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,237 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,238 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,238 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,238 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,238 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,238 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,238 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,239 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,240 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,240 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,240 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,240 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,240 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,242 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,243 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,245 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,245 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,247 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,249 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,249 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,250 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,250 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,251 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,251 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,251 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,252 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,252 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,252 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,256 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,256 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,259 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,260 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,260 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,260 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,260 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,261 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,262 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,262 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,262 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,262 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,263 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,263 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,264 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,265 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,265 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,265 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,265 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,266 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,266 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,272 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,273 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,273 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,273 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,273 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,273 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,274 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,274 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,275 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,276 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,276 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,276 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,276 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,276 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,281 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,283 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,283 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,284 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,285 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,286 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,288 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,289 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,293 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,293 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,293 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,293 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,296 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,297 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,297 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,297 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,297 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,297 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,297 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,298 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,299 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,300 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,300 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,300 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,301 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,301 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-18 11:06:34,302 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,311 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,311 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,311 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,311 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,312 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,312 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,313 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,313 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,313 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,314 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,318 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,319 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,319 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,320 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,321 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,321 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,321 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,322 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,323 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,323 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,324 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,324 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,325 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,325 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,325 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,325 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,327 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,327 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,327 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,327 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,328 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,328 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,328 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,328 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,329 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,329 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,330 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,330 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,331 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,331 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,336 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,336 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,336 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,337 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,339 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,339 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,339 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,339 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,341 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,341 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,354 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,354 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,354 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,354 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,354 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,355 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,355 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,356 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,356 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,356 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,356 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,356 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,357 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,358 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,358 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,359 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,359 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,360 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,361 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,361 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,373 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,373 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,373 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,374 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,375 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,375 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,375 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,376 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,376 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,376 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,376 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,376 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,377 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,383 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,384 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,384 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,385 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,390 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,390 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,390 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,390 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,390 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,391 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,391 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,392 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,392 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,393 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,393 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,393 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,393 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,395 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,395 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,396 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,397 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,408 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,408 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,408 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,409 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,409 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,410 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,411 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,411 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,411 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,411 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,411 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,412 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,412 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,413 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,416 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,417 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,418 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,419 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,419 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,430 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,430 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,431 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,431 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,431 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,431 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,431 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,432 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,436 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,437 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,437 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,437 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,437 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,437 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,438 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,440 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,440 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,440 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,440 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,441 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,441 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,441 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,441 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,445 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-18 11:06:34,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,448 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,448 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,449 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,450 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-18 11:06:34,450 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,451 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,451 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,451 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,451 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,451 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,451 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,452 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,452 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,453 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,453 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,454 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,466 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,466 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,471 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,471 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,471 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,471 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,471 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,471 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,472 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,474 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,474 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,474 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,474 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,474 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,475 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,475 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,475 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,475 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,476 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,477 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,477 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,477 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,477 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,477 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,477 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,477 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,478 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,479 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,489 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,489 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,490 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,492 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,492 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,492 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,492 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,492 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,492 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,492 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,493 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,493 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,496 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,496 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,496 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,496 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,496 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,497 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,507 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,508 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,508 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,509 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,509 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,510 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,510 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,510 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,510 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,510 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,510 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,510 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,512 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,512 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,512 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,513 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,514 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,514 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,527 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,527 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,527 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,527 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,527 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,527 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,528 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,528 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,529 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,529 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,529 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,529 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,530 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,532 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,532 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,532 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,533 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,533 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,534 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,546 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,546 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,546 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,546 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,546 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,547 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,547 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,551 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,554 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,554 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,555 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,555 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,555 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,556 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,565 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,567 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,567 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,567 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,567 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,568 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,568 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,569 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,569 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,570 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,570 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,570 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,570 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,571 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,571 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,571 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,572 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,572 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,573 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,573 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,573 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,573 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,573 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,573 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,574 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,574 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,577 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,578 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,578 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,578 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,579 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:34,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,591 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,591 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,591 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,591 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,591 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,592 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,593 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,593 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,594 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,594 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,594 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,594 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,594 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,594 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,595 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,595 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,597 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,598 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,599 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,599 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,599 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,599 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,600 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,600 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,600 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,600 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,601 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,612 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,613 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,613 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,613 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,616 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,617 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,617 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,618 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,623 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,624 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,624 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,624 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,624 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,627 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,627 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,634 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,635 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,635 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,639 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,640 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:34,640 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,640 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,640 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,640 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-18 11:06:34,640 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-18 11:06:34,640 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,642 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,642 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-18 11:06:34,642 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,642 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,642 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,643 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,643 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,643 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,643 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,643 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,643 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,645 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,656 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,657 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,657 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,657 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,657 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,658 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,658 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,679 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,680 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,680 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,680 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,680 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,680 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,682 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,684 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,685 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,685 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,686 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,690 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,690 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,691 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,691 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,691 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,691 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,691 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,691 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,692 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,693 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,694 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,695 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,695 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,695 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,695 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,695 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,695 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,697 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,697 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,698 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,698 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,698 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,698 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,698 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,698 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,701 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,704 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,705 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,705 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,705 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,709 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,709 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,710 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,710 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,711 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,713 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,713 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,714 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,714 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,714 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,714 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,714 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,714 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,715 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,715 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,728 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,731 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,731 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,731 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,731 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,731 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,731 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,732 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,732 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,734 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,734 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,735 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,735 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,735 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,735 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,735 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,735 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,736 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,739 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,750 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,750 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,750 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,750 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,751 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,751 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,753 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,754 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,754 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,754 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,754 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,754 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,754 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,755 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,755 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,765 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,766 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,769 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,770 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,784 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,784 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,785 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,785 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,791 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,791 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,794 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,795 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,795 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,795 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,795 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,795 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,796 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,796 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,799 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,799 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,799 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,800 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,800 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,800 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,801 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,801 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,809 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,810 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,810 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,810 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,810 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,811 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,812 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:34,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,816 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,817 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,817 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,817 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,817 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,817 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,817 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,825 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,826 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,826 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,827 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,828 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,828 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,832 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,832 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,833 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,833 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,833 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,833 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,834 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,836 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,837 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,837 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,837 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,837 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,838 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,838 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,843 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,843 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,844 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,844 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,844 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,844 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,844 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,844 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,845 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,846 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,852 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,854 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,854 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,855 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,855 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,855 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,859 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,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-18 11:06:34,860 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,860 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,860 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,860 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,861 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,865 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,865 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,866 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,866 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-18 11:06:34,866 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,866 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,866 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,866 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:34,867 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:34,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,923 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,923 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-18 11:06:34,924 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,924 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,924 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,924 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,924 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,924 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,925 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,925 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,925 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,932 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,933 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,933 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,933 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,933 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,934 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,934 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,935 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,935 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,962 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,963 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,964 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,964 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,964 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,964 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,964 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,964 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,966 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,975 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,976 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,976 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,976 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,977 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,977 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,978 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,979 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,979 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,980 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,980 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,982 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,983 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,984 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,984 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,985 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,986 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,987 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,987 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:34,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,988 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:34,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,990 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,990 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:34,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:34,991 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:34,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:34,998 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:34,999 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:34,999 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:34,999 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:34,999 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:34,999 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:34,999 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,000 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,000 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,000 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,001 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,002 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,002 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,002 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,002 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,002 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,002 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,003 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,003 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,004 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,004 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,005 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,005 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,005 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,005 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,005 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,005 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,006 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,006 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,007 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,007 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,008 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,008 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,008 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,008 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,008 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,008 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,009 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,009 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,010 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,011 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,011 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,011 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,011 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,011 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,012 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,012 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,012 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,012 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,013 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,014 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,015 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,015 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,015 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,015 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,015 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,016 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,016 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,017 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,017 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,018 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,018 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,018 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,018 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,018 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,019 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,020 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:35,020 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,027 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,027 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,028 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,028 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,028 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,028 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,028 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,028 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,030 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:35,030 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,040 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,041 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,041 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,041 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,042 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,042 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,042 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,043 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,045 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,045 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,045 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,046 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,046 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,047 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,047 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,048 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,050 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,050 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,052 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:35,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,060 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,061 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,061 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,061 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,061 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,061 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,063 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-18 11:06:35,063 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,071 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,072 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,072 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,072 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,074 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,076 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,086 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,087 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,087 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,088 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,092 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,092 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,093 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,093 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,093 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,093 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,093 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,093 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,094 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,095 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,096 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,096 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,096 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,096 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,096 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,097 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,102 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,111 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,111 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,112 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,112 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,113 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,124 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,125 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,125 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,126 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,126 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,130 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,131 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,131 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,131 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,132 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,133 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,148 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,148 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,148 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-18 11:06:35,149 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-18 11:06:35,149 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,150 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-18 11:06:35,151 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,151 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,152 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,152 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,154 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,154 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,154 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,154 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,155 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,155 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,174 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,174 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,175 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,175 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,175 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,178 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,179 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,179 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,180 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,180 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,182 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,182 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,183 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,183 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,199 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,200 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,200 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,200 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,200 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,200 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,200 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,200 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,202 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,202 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,202 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,206 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,207 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:35,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,209 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,209 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,224 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,227 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,227 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,227 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,228 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,230 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,230 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,231 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,231 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,231 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,231 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,231 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,231 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,232 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,232 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,233 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,250 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,250 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,251 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,251 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,251 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,252 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,253 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,253 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,253 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,253 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,253 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,254 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,254 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,254 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,254 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,256 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,256 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,257 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,257 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,257 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,257 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,257 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,257 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,257 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,257 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,259 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,259 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,276 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,276 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,276 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,276 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,277 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,277 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:35,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,280 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,280 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,281 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:35,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,294 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,294 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,294 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,294 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,294 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,294 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,295 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,295 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,306 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,306 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,306 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,306 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,306 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,307 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,307 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,309 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,309 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,310 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,310 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:35,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,312 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,313 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,313 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,313 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,313 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,313 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,313 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,313 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,314 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-18 11:06:35,314 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,317 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,333 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,333 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,333 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,334 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,337 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,337 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,338 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,338 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,340 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,340 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,340 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,342 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,343 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,343 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,343 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,343 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,343 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,343 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,343 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,345 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,359 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,359 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,359 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,359 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,359 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,359 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,362 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,365 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,365 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,365 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,365 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,365 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,366 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,367 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,372 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,373 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,373 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,373 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,373 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,373 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,373 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,373 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,374 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,374 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,376 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,377 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,388 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,389 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,389 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,392 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-18 11:06:35,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,392 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-18 11:06:35,393 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-18 11:06:35,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,397 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-18 11:06:35,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-18 11:06:35,397 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,398 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,398 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,398 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,400 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,414 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,414 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,414 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,414 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,415 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,429 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,430 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,435 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,435 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,435 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,435 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,435 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,436 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,452 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,453 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,453 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,453 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,453 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,453 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,453 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,453 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,454 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,454 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,456 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,457 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,457 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,458 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,459 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,460 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,460 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,460 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,460 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,460 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,460 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,461 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,461 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,461 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,464 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,465 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,465 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,465 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,465 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,465 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,465 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,465 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,466 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,470 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,470 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,481 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,481 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,481 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,482 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:06:35,482 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,485 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,485 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,485 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,486 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,486 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,486 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,486 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,487 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,490 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,490 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,490 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,490 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,490 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,490 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,491 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,491 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,493 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,508 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,508 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,508 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,508 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,509 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,511 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,511 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,512 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,513 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,513 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,513 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,516 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,516 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,516 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,517 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,519 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,520 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,535 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,535 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,535 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,536 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,536 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,536 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,536 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,536 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,541 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,541 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,541 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,542 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,542 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,542 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,542 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,542 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:06:35,543 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,547 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,548 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,549 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:06:35,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,568 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,568 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,569 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,574 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,575 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,575 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,577 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,578 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,578 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,578 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,578 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,578 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,579 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,579 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,579 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:06:35,579 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,597 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,598 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,598 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-18 11:06:35,598 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,599 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-18 11:06:35,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,602 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,602 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,602 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,602 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,602 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,602 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,603 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,603 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,604 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,604 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,615 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,617 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,617 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,629 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,629 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,629 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,630 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,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-18 11:06:35,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,632 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,633 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,633 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,633 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,636 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,636 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,637 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,637 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,637 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,637 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,637 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,637 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,638 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,638 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,649 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,649 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,659 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,660 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,660 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,660 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,660 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,660 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,660 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,665 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,666 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,667 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,670 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,670 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-18 11:06:35,671 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-18 11:06:35,671 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-18 11:06:35,671 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-18 11:06:35,671 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-18 11:06:35,671 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-18 11:06:35,671 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-18 11:06:35,672 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-18 11:06:35,672 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-18 11:06:35,674 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-18 11:06:35,674 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:35,674 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:35,689 INFO L87 Difference]: Start difference. First operand 1147 states and 1509 transitions. cyclomatic complexity: 363 Second operand 3 states. [2018-11-18 11:06:35,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:35,956 INFO L93 Difference]: Finished difference Result 1147 states and 1493 transitions. [2018-11-18 11:06:35,957 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:35,957 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1147 states and 1493 transitions. [2018-11-18 11:06:35,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-18 11:06:35,968 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1147 states to 1147 states and 1493 transitions. [2018-11-18 11:06:35,968 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1147 [2018-11-18 11:06:35,969 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1147 [2018-11-18 11:06:35,969 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1147 states and 1493 transitions. [2018-11-18 11:06:35,970 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:35,971 INFO L705 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-18 11:06:35,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1147 states and 1493 transitions. [2018-11-18 11:06:35,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1147 to 1147. [2018-11-18 11:06:35,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1147 states. [2018-11-18 11:06:35,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1147 states to 1147 states and 1493 transitions. [2018-11-18 11:06:35,990 INFO L728 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-18 11:06:35,991 INFO L608 BuchiCegarLoop]: Abstraction has 1147 states and 1493 transitions. [2018-11-18 11:06:35,991 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-18 11:06:35,991 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1147 states and 1493 transitions. [2018-11-18 11:06:35,995 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1114 [2018-11-18 11:06:35,995 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:35,995 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:35,996 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:35,996 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:35,996 INFO L794 eck$LassoCheckResult]: Stem: 17249#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 17100#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 17101#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 17109#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 17110#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 17210#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 17211#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 17251#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 17156#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17157#L108 assume !(1 == ~P_1_pc~0); 17134#L108-2 is_P_1_triggered_~__retres1~0 := 0; 17220#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17291#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17273#L481 assume !(0 != activate_threads_~tmp~1); 17274#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17245#L176 assume !(1 == ~P_2_pc~0); 17246#L176-2 is_P_2_triggered_~__retres1~1 := 0; 17247#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17180#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17181#L489 assume !(0 != activate_threads_~tmp___0~1); 17279#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17287#L258 assume !(1 == ~C_1_pc~0); 17281#L258-2 assume !(2 == ~C_1_pc~0); 17190#L268-1 is_C_1_triggered_~__retres1~2 := 0; 17191#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17195#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17130#L497 assume !(0 != activate_threads_~tmp___1~1); 17131#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 17145#L422 assume { :end_inline_reset_delta_events } true; 17196#L551-3 [2018-11-18 11:06:35,996 INFO L796 eck$LassoCheckResult]: Loop: 17196#L551-3 assume true; 17689#L551-1 assume !false; 17493#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 17490#L387 assume true; 17488#L347-1 assume !false; 17486#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17484#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17482#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17480#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17478#L352 assume 0 != eval_~tmp___2~0; 17476#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17473#L361 assume 0 != eval_~tmp~0;~P_1_st~0 := 1;assume { :begin_inline_P_1 } true; 17474#L73 assume 0 == ~P_1_pc~0; 17682#L77 assume true; 17680#L84 assume !(~i~0 < ~max_loop~0); 17672#L96 ~P_1_st~0 := 2; 17464#L100 assume { :end_inline_P_1 } true; 17462#L357 assume !(0 == ~P_2_st~0); 17218#L372 assume !(0 == ~C_1_st~0); 17080#L387 assume true; 17081#L347-1 assume !false; 17160#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17107#L318 assume !(0 == ~P_1_st~0); 17108#L322 assume !(0 == ~P_2_st~0); 17161#L326 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 17163#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18132#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 18133#L352 assume !(0 != eval_~tmp___2~0); 17158#L403 assume { :end_inline_eval } true;start_simulation_~kernel_st~0 := 2;assume { :begin_inline_update_channels } true; 17098#L288-1 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0 := 3;assume { :begin_inline_fire_delta_events } true; 17099#L414-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17159#L108-6 assume 1 == ~P_1_pc~0; 17113#L109-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 17114#L119-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 18131#L120-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 18130#L481-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17253#L481-8 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17248#L176-6 assume !(1 == ~P_2_pc~0); 17228#L176-8 is_P_2_triggered_~__retres1~1 := 0; 17229#L187-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17171#L188-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17172#L489-6 assume !(0 != activate_threads_~tmp___0~1); 17272#L489-8 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17256#L258-6 assume !(1 == ~C_1_pc~0); 17254#L258-8 assume !(2 == ~C_1_pc~0); 17150#L268-5 is_C_1_triggered_~__retres1~2 := 0; 17151#L279-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17189#L280-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17285#L497-6 assume !(0 != activate_threads_~tmp___1~1); 18148#L497-8 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 18146#L422-1 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18144#L318-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 18142#L335-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18140#L336-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 18138#L570 assume !(0 == start_simulation_~tmp~3); 18136#L570-2 assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res;havoc stop_simulation_#t~ret8, stop_simulation_~tmp~2, stop_simulation_~__retres2~0;havoc stop_simulation_~tmp~2;havoc stop_simulation_~__retres2~0;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 18135#L318-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 18110#L335-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 18109#L336-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 18108#L525 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17694#L532 stop_simulation_#res := stop_simulation_~__retres2~0; 17693#L533 start_simulation_#t~ret10 := stop_simulation_#res;assume { :end_inline_stop_simulation } true;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17690#L583 assume !(0 != start_simulation_~tmp___0~2); 17196#L551-3 [2018-11-18 11:06:35,997 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:35,997 INFO L82 PathProgramCache]: Analyzing trace with hash 1966545068, now seen corresponding path program 6 times [2018-11-18 11:06:35,997 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:35,997 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:35,997 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:35,998 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:35,998 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,009 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,009 INFO L82 PathProgramCache]: Analyzing trace with hash 1013796560, now seen corresponding path program 1 times [2018-11-18 11:06:36,009 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,009 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,010 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:36,010 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:36,093 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:36,093 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:36,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:36,094 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-18 11:06:36,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:36,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:36,094 INFO L87 Difference]: Start difference. First operand 1147 states and 1493 transitions. cyclomatic complexity: 347 Second operand 3 states. [2018-11-18 11:06:36,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:36,288 INFO L93 Difference]: Finished difference Result 1920 states and 2481 transitions. [2018-11-18 11:06:36,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:36,290 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1920 states and 2481 transitions. [2018-11-18 11:06:36,297 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1876 [2018-11-18 11:06:36,301 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1920 states to 1920 states and 2481 transitions. [2018-11-18 11:06:36,301 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1920 [2018-11-18 11:06:36,303 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1920 [2018-11-18 11:06:36,303 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1920 states and 2481 transitions. [2018-11-18 11:06:36,305 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:36,306 INFO L705 BuchiCegarLoop]: Abstraction has 1920 states and 2481 transitions. [2018-11-18 11:06:36,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1920 states and 2481 transitions. [2018-11-18 11:06:36,319 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1920 to 1904. [2018-11-18 11:06:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1904 states. [2018-11-18 11:06:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1904 states to 1904 states and 2461 transitions. [2018-11-18 11:06:36,323 INFO L728 BuchiCegarLoop]: Abstraction has 1904 states and 2461 transitions. [2018-11-18 11:06:36,323 INFO L608 BuchiCegarLoop]: Abstraction has 1904 states and 2461 transitions. [2018-11-18 11:06:36,323 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-18 11:06:36,323 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1904 states and 2461 transitions. [2018-11-18 11:06:36,327 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1860 [2018-11-18 11:06:36,328 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:36,328 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:36,328 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,328 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,328 INFO L794 eck$LassoCheckResult]: Stem: 20338#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 20170#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 20171#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 20181#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 20182#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 20288#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 20289#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 20339#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 20230#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 20231#L108 assume !(1 == ~P_1_pc~0); 20301#L108-2 is_P_1_triggered_~__retres1~0 := 0; 20302#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 20207#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 20208#L481 assume !(0 != activate_threads_~tmp~1); 20369#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20331#L176 assume !(1 == ~P_2_pc~0); 20332#L176-2 is_P_2_triggered_~__retres1~1 := 0; 20333#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20255#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 20256#L489 assume !(0 != activate_threads_~tmp___0~1); 20374#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20382#L258 assume !(1 == ~C_1_pc~0); 20380#L258-2 assume !(2 == ~C_1_pc~0); 20266#L268-1 is_C_1_triggered_~__retres1~2 := 0; 20267#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 20271#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 20205#L497 assume !(0 != activate_threads_~tmp___1~1); 20206#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 20215#L422 assume { :end_inline_reset_delta_events } true; 20272#L551-3 assume true; 21554#L551-1 assume !false; 21519#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 21516#L387 [2018-11-18 11:06:36,329 INFO L796 eck$LassoCheckResult]: Loop: 21516#L387 assume true; 21510#L347-1 assume !false; 21508#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21506#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21501#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21497#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 21493#L352 assume 0 != eval_~tmp___2~0; 21489#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 21484#L361 assume !(0 != eval_~tmp~0); 21480#L357 assume !(0 == ~P_2_st~0); 21479#L372 assume !(0 == ~C_1_st~0); 21516#L387 [2018-11-18 11:06:36,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 1 times [2018-11-18 11:06:36,329 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,329 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,330 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,337 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,338 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 1 times [2018-11-18 11:06:36,338 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,338 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,338 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,338 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,342 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,342 INFO L82 PathProgramCache]: Analyzing trace with hash -825812880, now seen corresponding path program 1 times [2018-11-18 11:06:36,342 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,342 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,342 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,342 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:36,375 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:36,375 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:36,375 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:36,401 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:36,401 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:36,401 INFO L87 Difference]: Start difference. First operand 1904 states and 2461 transitions. cyclomatic complexity: 560 Second operand 3 states. [2018-11-18 11:06:36,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:36,458 INFO L93 Difference]: Finished difference Result 3071 states and 3921 transitions. [2018-11-18 11:06:36,460 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:36,460 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3071 states and 3921 transitions. [2018-11-18 11:06:36,467 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2989 [2018-11-18 11:06:36,473 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3071 states to 3071 states and 3921 transitions. [2018-11-18 11:06:36,473 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3071 [2018-11-18 11:06:36,475 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3071 [2018-11-18 11:06:36,475 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3071 states and 3921 transitions. [2018-11-18 11:06:36,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:36,478 INFO L705 BuchiCegarLoop]: Abstraction has 3071 states and 3921 transitions. [2018-11-18 11:06:36,480 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3071 states and 3921 transitions. [2018-11-18 11:06:36,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3071 to 2971. [2018-11-18 11:06:36,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2971 states. [2018-11-18 11:06:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2971 states to 2971 states and 3801 transitions. [2018-11-18 11:06:36,561 INFO L728 BuchiCegarLoop]: Abstraction has 2971 states and 3801 transitions. [2018-11-18 11:06:36,561 INFO L608 BuchiCegarLoop]: Abstraction has 2971 states and 3801 transitions. [2018-11-18 11:06:36,561 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-18 11:06:36,562 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2971 states and 3801 transitions. [2018-11-18 11:06:36,569 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-18 11:06:36,569 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:36,569 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:36,570 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,570 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,570 INFO L794 eck$LassoCheckResult]: Stem: 25331#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 25153#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 25154#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 25166#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 25167#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 25277#L295-2 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25278#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 27563#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 27562#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 27561#L108 assume !(1 == ~P_1_pc~0); 27560#L108-2 is_P_1_triggered_~__retres1~0 := 0; 27559#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 27558#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 27557#L481 assume !(0 != activate_threads_~tmp~1); 27556#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 27555#L176 assume !(1 == ~P_2_pc~0); 27554#L176-2 is_P_2_triggered_~__retres1~1 := 0; 27553#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 27552#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27551#L489 assume !(0 != activate_threads_~tmp___0~1); 27550#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 27549#L258 assume !(1 == ~C_1_pc~0); 25370#L258-2 assume !(2 == ~C_1_pc~0); 25253#L268-1 is_C_1_triggered_~__retres1~2 := 0; 25254#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 25259#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 25187#L497 assume !(0 != activate_threads_~tmp___1~1); 25188#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 27508#L422 assume { :end_inline_reset_delta_events } true; 27506#L551-3 assume true; 27503#L551-1 assume !false; 27499#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 27496#L387 [2018-11-18 11:06:36,570 INFO L796 eck$LassoCheckResult]: Loop: 27496#L387 assume true; 27495#L347-1 assume !false; 27494#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27493#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 27492#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27491#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 27490#L352 assume 0 != eval_~tmp___2~0; 27489#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 25286#L361 assume !(0 != eval_~tmp~0); 25287#L357 assume !(0 == ~P_2_st~0); 27497#L372 assume !(0 == ~C_1_st~0); 27496#L387 [2018-11-18 11:06:36,570 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,571 INFO L82 PathProgramCache]: Analyzing trace with hash -381421525, now seen corresponding path program 1 times [2018-11-18 11:06:36,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,571 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,571 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,571 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:36,611 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:36,611 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:36,611 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-18 11:06:36,611 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-18 11:06:36,611 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,612 INFO L82 PathProgramCache]: Analyzing trace with hash 2000037912, now seen corresponding path program 2 times [2018-11-18 11:06:36,612 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,612 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,612 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:36,654 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:36,654 INFO L87 Difference]: Start difference. First operand 2971 states and 3801 transitions. cyclomatic complexity: 833 Second operand 3 states. [2018-11-18 11:06:36,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:36,671 INFO L93 Difference]: Finished difference Result 2945 states and 3774 transitions. [2018-11-18 11:06:36,672 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:36,673 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2945 states and 3774 transitions. [2018-11-18 11:06:36,681 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-18 11:06:36,694 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2945 states to 2945 states and 3774 transitions. [2018-11-18 11:06:36,695 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2945 [2018-11-18 11:06:36,696 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2945 [2018-11-18 11:06:36,696 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2945 states and 3774 transitions. [2018-11-18 11:06:36,699 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:36,699 INFO L705 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-18 11:06:36,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2945 states and 3774 transitions. [2018-11-18 11:06:36,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2945 to 2945. [2018-11-18 11:06:36,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2945 states. [2018-11-18 11:06:36,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2945 states to 2945 states and 3774 transitions. [2018-11-18 11:06:36,733 INFO L728 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-18 11:06:36,733 INFO L608 BuchiCegarLoop]: Abstraction has 2945 states and 3774 transitions. [2018-11-18 11:06:36,733 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-18 11:06:36,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2945 states and 3774 transitions. [2018-11-18 11:06:36,740 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2889 [2018-11-18 11:06:36,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:36,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:36,741 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,741 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:36,741 INFO L794 eck$LassoCheckResult]: Stem: 31243#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 31077#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 31078#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 31088#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 31089#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 31197#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 31198#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 31245#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 31134#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 31135#L108 assume !(1 == ~P_1_pc~0); 31207#L108-2 is_P_1_triggered_~__retres1~0 := 0; 31208#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 31111#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 31112#L481 assume !(0 != activate_threads_~tmp~1); 31271#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 31236#L176 assume !(1 == ~P_2_pc~0); 31237#L176-2 is_P_2_triggered_~__retres1~1 := 0; 31238#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 31162#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 31163#L489 assume !(0 != activate_threads_~tmp___0~1); 31276#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 31285#L258 assume !(1 == ~C_1_pc~0); 31278#L258-2 assume !(2 == ~C_1_pc~0); 31174#L268-1 is_C_1_triggered_~__retres1~2 := 0; 31175#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 31179#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 31109#L497 assume !(0 != activate_threads_~tmp___1~1); 31110#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 31123#L422 assume { :end_inline_reset_delta_events } true; 31180#L551-3 assume true; 32741#L551-1 assume !false; 32554#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 32555#L387 [2018-11-18 11:06:36,741 INFO L796 eck$LassoCheckResult]: Loop: 32555#L387 assume true; 32831#L347-1 assume !false; 32830#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 32536#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 32533#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 32534#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 32616#L352 assume 0 != eval_~tmp___2~0; 32614#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 32523#L361 assume !(0 != eval_~tmp~0); 32497#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32493#L376 assume !(0 != eval_~tmp___0~0); 32494#L372 assume !(0 == ~C_1_st~0); 32555#L387 [2018-11-18 11:06:36,741 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,742 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 2 times [2018-11-18 11:06:36,742 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,742 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,742 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:36,742 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,749 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,749 INFO L82 PathProgramCache]: Analyzing trace with hash 1871491567, now seen corresponding path program 1 times [2018-11-18 11:06:36,750 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,750 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,750 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:36,750 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:36,754 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:36,754 INFO L82 PathProgramCache]: Analyzing trace with hash 169462935, now seen corresponding path program 1 times [2018-11-18 11:06:36,754 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:36,754 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:36,754 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,754 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:36,755 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:36,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-18 11:06:36,788 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-18 11:06:36,788 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-18 11:06:36,788 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-18 11:06:36,892 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-18 11:06:36,892 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-18 11:06:36,892 INFO L87 Difference]: Start difference. First operand 2945 states and 3774 transitions. cyclomatic complexity: 832 Second operand 3 states. [2018-11-18 11:06:36,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-18 11:06:36,955 INFO L93 Difference]: Finished difference Result 4851 states and 6158 transitions. [2018-11-18 11:06:36,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-18 11:06:36,956 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4851 states and 6158 transitions. [2018-11-18 11:06:36,969 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4771 [2018-11-18 11:06:36,983 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4851 states to 4851 states and 6158 transitions. [2018-11-18 11:06:36,983 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4851 [2018-11-18 11:06:36,986 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4851 [2018-11-18 11:06:36,986 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4851 states and 6158 transitions. [2018-11-18 11:06:36,989 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-18 11:06:36,989 INFO L705 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-18 11:06:36,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4851 states and 6158 transitions. [2018-11-18 11:06:37,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4851 to 4851. [2018-11-18 11:06:37,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4851 states. [2018-11-18 11:06:37,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4851 states to 4851 states and 6158 transitions. [2018-11-18 11:06:37,039 INFO L728 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-18 11:06:37,039 INFO L608 BuchiCegarLoop]: Abstraction has 4851 states and 6158 transitions. [2018-11-18 11:06:37,039 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-18 11:06:37,039 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4851 states and 6158 transitions. [2018-11-18 11:06:37,051 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4771 [2018-11-18 11:06:37,051 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-18 11:06:37,051 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-18 11:06:37,051 INFO L866 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:37,052 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-18 11:06:37,052 INFO L794 eck$LassoCheckResult]: Stem: 39048#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;~max_loop~0 := 0;~clk~0 := 0;~num~0 := 0;~i~0 := 0;~e~0 := 0;~timer~0 := 0;~data_0~0 := 0;~data_1~0 := 0;~P_1_pc~0 := 0;~P_1_st~0 := 0;~P_1_i~0 := 0;~P_1_ev~0 := 0;~P_2_pc~0 := 0;~P_2_st~0 := 0;~P_2_i~0 := 0;~P_2_ev~0 := 0;~C_1_pc~0 := 0;~C_1_st~0 := 0;~C_1_i~0 := 0;~C_1_ev~0 := 0;~C_1_pr~0 := 0; 38880#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~clk~0 := 0;~max_loop~0 := 8;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;assume { :begin_inline_init_model } true;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 38881#L603 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret9, start_simulation_#t~ret10, start_simulation_~kernel_st~0, start_simulation_~tmp~3, start_simulation_~tmp___0~2;havoc start_simulation_~kernel_st~0;havoc start_simulation_~tmp~3;havoc start_simulation_~tmp___0~2;start_simulation_~kernel_st~0 := 0;assume { :begin_inline_update_channels } true; 38891#L288 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 38892#L295 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 38999#L295-2 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 39000#L300-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 39049#L305-1 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 38939#L414 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret5, activate_threads_#t~ret6, activate_threads_#t~ret7, activate_threads_~tmp~1, activate_threads_~tmp___0~1, activate_threads_~tmp___1~1;havoc activate_threads_~tmp~1;havoc activate_threads_~tmp___0~1;havoc activate_threads_~tmp___1~1;assume { :begin_inline_is_P_1_triggered } true;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 38940#L108 assume !(1 == ~P_1_pc~0); 39010#L108-2 is_P_1_triggered_~__retres1~0 := 0; 39011#L119 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38916#L120 activate_threads_#t~ret5 := is_P_1_triggered_#res;assume { :end_inline_is_P_1_triggered } true;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38917#L481 assume !(0 != activate_threads_~tmp~1); 39081#L481-2 assume { :begin_inline_is_P_2_triggered } true;havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 39041#L176 assume !(1 == ~P_2_pc~0); 39042#L176-2 is_P_2_triggered_~__retres1~1 := 0; 39043#L187 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 38966#L188 activate_threads_#t~ret6 := is_P_2_triggered_#res;assume { :end_inline_is_P_2_triggered } true;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 38967#L489 assume !(0 != activate_threads_~tmp___0~1); 39083#L489-2 assume { :begin_inline_is_C_1_triggered } true;havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 39091#L258 assume !(1 == ~C_1_pc~0); 39086#L258-2 assume !(2 == ~C_1_pc~0); 38977#L268-1 is_C_1_triggered_~__retres1~2 := 0; 38978#L279 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38983#L280 activate_threads_#t~ret7 := is_C_1_triggered_#res;assume { :end_inline_is_C_1_triggered } true;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 38914#L497 assume !(0 != activate_threads_~tmp___1~1); 38915#L497-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 38924#L422 assume { :end_inline_reset_delta_events } true; 38984#L551-3 assume true; 40563#L551-1 assume !false; 40440#L552 start_simulation_~kernel_st~0 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret1, eval_#t~nondet2, eval_#t~nondet3, eval_#t~nondet4, eval_~tmp~0, eval_~tmp___0~0, eval_~tmp___1~0, eval_~tmp___2~0;havoc eval_~tmp~0;havoc eval_~tmp___0~0;havoc eval_~tmp___1~0;havoc eval_~tmp___2~0; 40438#L387 [2018-11-18 11:06:37,052 INFO L796 eck$LassoCheckResult]: Loop: 40438#L387 assume true; 40436#L347-1 assume !false; 40434#L348 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 40432#L318 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 40430#L335 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 40428#L336 eval_#t~ret1 := exists_runnable_thread_#res;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 40426#L352 assume 0 != eval_~tmp___2~0; 40424#L352-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 40419#L361 assume !(0 != eval_~tmp~0); 40417#L357 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 40394#L376 assume !(0 != eval_~tmp___0~0); 40415#L372 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 40441#L391 assume !(0 != eval_~tmp___1~0); 40438#L387 [2018-11-18 11:06:37,052 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:37,052 INFO L82 PathProgramCache]: Analyzing trace with hash 1990317737, now seen corresponding path program 3 times [2018-11-18 11:06:37,052 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:37,052 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:37,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,060 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:37,060 INFO L82 PathProgramCache]: Analyzing trace with hash -2113305569, now seen corresponding path program 1 times [2018-11-18 11:06:37,060 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:37,060 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,061 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-18 11:06:37,061 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,065 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-18 11:06:37,065 INFO L82 PathProgramCache]: Analyzing trace with hash 958381687, now seen corresponding path program 1 times [2018-11-18 11:06:37,065 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-18 11:06:37,066 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-18 11:06:37,068 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,068 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-18 11:06:37,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-18 11:06:37,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-18 11:06:37,394 WARN L180 SmtUtils]: Spent 234.00 ms on a formula simplification. DAG size of input: 110 DAG size of output: 98 [2018-11-18 11:06:37,465 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 18.11 11:06:37 BoogieIcfgContainer [2018-11-18 11:06:37,465 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-18 11:06:37,465 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-18 11:06:37,465 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-18 11:06:37,465 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-18 11:06:37,466 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.11 11:06:31" (3/4) ... [2018-11-18 11:06:37,468 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-18 11:06:37,511 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_c6f0187c-13b5-4d69-8c43-297ab51fc56b/bin-2019/uautomizer/witness.graphml [2018-11-18 11:06:37,512 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-18 11:06:37,512 INFO L168 Benchmark]: Toolchain (without parser) took 6984.93 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.7 MB). Free memory was 961.9 MB in the beginning and 1.0 GB in the end (delta: -62.3 MB). Peak memory consumption was 234.4 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,513 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:06:37,513 INFO L168 Benchmark]: CACSL2BoogieTranslator took 207.57 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,514 INFO L168 Benchmark]: Boogie Procedure Inliner took 71.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,514 INFO L168 Benchmark]: Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,514 INFO L168 Benchmark]: RCFGBuilder took 458.33 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,514 INFO L168 Benchmark]: BuchiAutomizer took 6169.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.4 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. [2018-11-18 11:06:37,514 INFO L168 Benchmark]: Witness Printer took 46.56 ms. Allocated memory is still 1.3 GB. Free memory is still 1.0 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-18 11:06:37,516 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 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 207.57 ms. Allocated memory is still 1.0 GB. Free memory was 961.9 MB in the beginning and 945.7 MB in the end (delta: 16.2 MB). Peak memory consumption was 16.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 71.11 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.1 MB). Free memory was 945.7 MB in the beginning and 1.1 GB in the end (delta: -197.5 MB). Peak memory consumption was 21.1 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 28.23 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 8.1 MB). Peak memory consumption was 8.1 MB. Max. memory is 11.5 GB. * RCFGBuilder took 458.33 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: 46.6 MB). Peak memory consumption was 46.6 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 6169.84 ms. Allocated memory was 1.2 GB in the beginning and 1.3 GB in the end (delta: 154.7 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 64.4 MB). Peak memory consumption was 219.0 MB. Max. memory is 11.5 GB. * Witness Printer took 46.56 ms. Allocated memory is still 1.3 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 14 terminating modules (14 trivial, 0 deterministic, 0 nondeterministic) and one nonterminating remainder module.14 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 4851 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.1s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 4.3s. Construction of modules took 0.7s. Büchi inclusion checks took 0.3s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 14 MinimizatonAttempts, 4076 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 4851 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3813 SDtfs, 4723 SDslu, 4970 SDs, 0 SdLazy, 311 SolverSat, 122 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time LassoAnalysisResults: nont1 unkn0 SFLI5 SFLT0 conc3 concLT0 SILN1 SILU0 SILI5 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital89 mio100 ax100 hnf100 lsp12 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 3 Time: 13ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 15 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 347]: 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 {count=0, \result=0, P_1_pc=0, C_1_i=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1f39c26=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@1a345578=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@525d75e8=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@38ed7f25=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=0, clk=0, __retres1=0, tmp___0=0, num=0, P_1_ev=0, tmp=0, C_1_pc=0, P_2_st=0, P_2_i=1, \result=0, __retres1=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@120d63d9=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=8, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3dbf1c14=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@480fcc23=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@30c04fbe=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f58d0e1=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 347]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int clk ; [L17] int num ; [L18] int i ; [L19] int e ; [L20] int timer ; [L21] char data_0 ; [L22] char data_1 ; [L65] int P_1_pc; [L66] int P_1_st ; [L67] int P_1_i ; [L68] int P_1_ev ; [L123] int P_2_pc ; [L124] int P_2_st ; [L125] int P_2_i ; [L126] int P_2_ev ; [L191] int C_1_pc ; [L192] int C_1_st ; [L193] int C_1_i ; [L194] int C_1_ev ; [L195] int C_1_pr ; [L607] int count ; [L608] int __retres2 ; [L612] num = 0 [L613] i = 0 [L614] clk = 0 [L615] max_loop = 8 [L617] timer = 0 [L618] P_1_pc = 0 [L619] P_2_pc = 0 [L620] C_1_pc = 0 [L622] count = 0 [L623] CALL init_model() [L599] P_1_i = 1 [L600] P_2_i = 1 [L601] RET C_1_i = 1 [L623] init_model() [L624] CALL start_simulation() [L537] int kernel_st ; [L538] int tmp ; [L539] int tmp___0 ; [L543] kernel_st = 0 [L544] FCALL update_channels() [L545] CALL init_threads() [L295] COND TRUE (int )P_1_i == 1 [L296] P_1_st = 0 [L300] COND TRUE (int )P_2_i == 1 [L301] P_2_st = 0 [L305] COND TRUE (int )C_1_i == 1 [L306] RET C_1_st = 0 [L545] init_threads() [L546] FCALL fire_delta_events() [L547] CALL activate_threads() [L473] int tmp ; [L474] int tmp___0 ; [L475] int tmp___1 ; [L479] CALL, EXPR is_P_1_triggered() [L105] int __retres1 ; [L108] COND FALSE !((int )P_1_pc == 1) [L118] __retres1 = 0 [L120] RET return (__retres1); [L479] EXPR is_P_1_triggered() [L479] tmp = is_P_1_triggered() [L481] COND FALSE !(\read(tmp)) [L487] CALL, EXPR is_P_2_triggered() [L173] int __retres1 ; [L176] COND FALSE !((int )P_2_pc == 1) [L186] __retres1 = 0 [L188] RET return (__retres1); [L487] EXPR is_P_2_triggered() [L487] tmp___0 = is_P_2_triggered() [L489] COND FALSE !(\read(tmp___0)) [L495] CALL, EXPR is_C_1_triggered() [L255] int __retres1 ; [L258] COND FALSE !((int )C_1_pc == 1) [L268] COND FALSE !((int )C_1_pc == 2) [L278] __retres1 = 0 [L280] RET return (__retres1); [L495] EXPR is_C_1_triggered() [L495] tmp___1 = is_C_1_triggered() [L497] COND FALSE, RET !(\read(tmp___1)) [L547] activate_threads() [L548] FCALL reset_delta_events() [L551] COND TRUE 1 [L554] kernel_st = 1 [L555] CALL eval() [L340] int tmp ; [L341] int tmp___0 ; [L342] int tmp___1 ; [L343] int tmp___2 ; Loop: [L347] COND TRUE 1 [L350] CALL, EXPR exists_runnable_thread() [L315] int __retres1 ; [L318] COND TRUE (int )P_1_st == 0 [L319] __retres1 = 1 [L336] RET return (__retres1); [L350] EXPR exists_runnable_thread() [L350] tmp___2 = exists_runnable_thread() [L352] COND TRUE \read(tmp___2) [L357] COND TRUE (int )P_1_st == 0 [L359] tmp = __VERIFIER_nondet_int() [L361] COND FALSE !(\read(tmp)) [L372] COND TRUE (int )P_2_st == 0 [L374] tmp___0 = __VERIFIER_nondet_int() [L376] COND FALSE !(\read(tmp___0)) [L387] COND TRUE (int )C_1_st == 0 [L389] tmp___1 = __VERIFIER_nondet_int() [L391] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...