./Ultimate.py --spec ../../sv-benchmarks/c/properties/termination.prp --file ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/config/AutomizerTermination.xml -i ../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/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 2559ce56d5bdfaeec5255956226223494fe099f5 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-635dfa2 [2018-12-02 03:17:07,766 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 03:17:07,768 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 03:17:07,775 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 03:17:07,775 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 03:17:07,776 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 03:17:07,777 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 03:17:07,778 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 03:17:07,779 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 03:17:07,779 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 03:17:07,780 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 03:17:07,780 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 03:17:07,781 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 03:17:07,781 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 03:17:07,782 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 03:17:07,782 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 03:17:07,783 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 03:17:07,784 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 03:17:07,785 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 03:17:07,786 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 03:17:07,787 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 03:17:07,788 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 03:17:07,789 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 03:17:07,790 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 03:17:07,790 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 03:17:07,790 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 03:17:07,791 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 03:17:07,792 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 03:17:07,792 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 03:17:07,793 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 03:17:07,793 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 03:17:07,793 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 03:17:07,794 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 03:17:07,794 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 03:17:07,794 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 03:17:07,795 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 03:17:07,795 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-12-02 03:17:07,806 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 03:17:07,806 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 03:17:07,807 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-12-02 03:17:07,807 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-12-02 03:17:07,807 INFO L133 SettingsManager]: * Use SBE=true [2018-12-02 03:17:07,807 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Use old map elimination=false [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-12-02 03:17:07,808 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-02 03:17:07,808 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Use constant arrays=true [2018-12-02 03:17:07,809 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-12-02 03:17:07,810 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 03:17:07,810 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 03:17:07,810 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-12-02 03:17:07,810 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 03:17:07,810 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-12-02 03:17:07,810 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-12-02 03:17:07,810 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-12-02 03:17:07,810 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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 -> 2559ce56d5bdfaeec5255956226223494fe099f5 [2018-12-02 03:17:07,834 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 03:17:07,842 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 03:17:07,845 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 03:17:07,846 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 03:17:07,846 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 03:17:07,847 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/../../sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-12-02 03:17:07,884 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/data/bd65b0207/70ecb1254e314b6fa087d3ac6422313a/FLAGaf173e521 [2018-12-02 03:17:08,289 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 03:17:08,289 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/sv-benchmarks/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-12-02 03:17:08,294 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/data/bd65b0207/70ecb1254e314b6fa087d3ac6422313a/FLAGaf173e521 [2018-12-02 03:17:08,302 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/data/bd65b0207/70ecb1254e314b6fa087d3ac6422313a [2018-12-02 03:17:08,304 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 03:17:08,304 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 03:17:08,305 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 03:17:08,305 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 03:17:08,307 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 03:17:08,307 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,309 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4c1e788d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08, skipping insertion in model container [2018-12-02 03:17:08,309 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,313 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 03:17:08,329 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 03:17:08,435 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:17:08,438 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 03:17:08,461 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 03:17:08,473 INFO L195 MainTranslator]: Completed translation [2018-12-02 03:17:08,473 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08 WrapperNode [2018-12-02 03:17:08,473 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 03:17:08,474 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 03:17:08,474 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 03:17:08,474 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 03:17:08,479 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,483 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,536 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 03:17:08,536 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 03:17:08,536 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 03:17:08,537 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 03:17:08,542 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,542 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,547 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,552 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,554 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... [2018-12-02 03:17:08,556 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 03:17:08,556 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 03:17:08,556 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 03:17:08,556 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 03:17:08,557 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:08,588 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 03:17:08,588 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 03:17:08,890 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 03:17:08,890 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-12-02 03:17:08,890 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:08 BoogieIcfgContainer [2018-12-02 03:17:08,890 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 03:17:08,891 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-12-02 03:17:08,891 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-12-02 03:17:08,893 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-12-02 03:17:08,893 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:17:08,893 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 02.12 03:17:08" (1/3) ... [2018-12-02 03:17:08,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b7a4f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:17:08, skipping insertion in model container [2018-12-02 03:17:08,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:17:08,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 03:17:08" (2/3) ... [2018-12-02 03:17:08,894 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@4b7a4f8c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 02.12 03:17:08, skipping insertion in model container [2018-12-02 03:17:08,894 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-12-02 03:17:08,894 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:08" (3/3) ... [2018-12-02 03:17:08,895 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-12-02 03:17:08,926 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-12-02 03:17:08,926 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-12-02 03:17:08,926 INFO L375 BuchiCegarLoop]: Hoare is false [2018-12-02 03:17:08,927 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-12-02 03:17:08,927 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 03:17:08,927 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 03:17:08,927 INFO L379 BuchiCegarLoop]: Difference is false [2018-12-02 03:17:08,927 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 03:17:08,927 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-12-02 03:17:08,937 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-12-02 03:17:08,953 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-12-02 03:17:08,954 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:08,954 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:08,959 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] [2018-12-02 03:17:08,959 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] [2018-12-02 03:17:08,959 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-12-02 03:17:08,959 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-12-02 03:17:08,963 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-12-02 03:17:08,963 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:08,963 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:08,964 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] [2018-12-02 03:17:08,964 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] [2018-12-02 03:17:08,968 INFO L794 eck$LassoCheckResult]: Stem: 129#ULTIMATE.startENTRYtrue ~max_loop~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; 15#L-1true havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 115#L589true 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; 79#L287true assume !(1 == ~P_1_i~0);~P_1_st~0 := 2; 140#L294-1true assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 16#L299-1true assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 51#L304-1true 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 146#L107true assume !(1 == ~P_1_pc~0); 122#L107-2true is_P_1_triggered_~__retres1~0 := 0; 149#L118true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 89#L119true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 167#L467true assume !(0 != activate_threads_~tmp~1); 172#L467-2true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3#L175true assume 1 == ~P_2_pc~0; 113#L176true assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 4#L186true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 114#L187true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 27#L475true assume !(0 != activate_threads_~tmp___0~1); 5#L475-2true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 72#L257true assume 1 == ~C_1_pc~0; 173#L258true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 131#L278true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 74#L279true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 33#L483true assume !(0 != activate_threads_~tmp___1~1); 97#L537-1true [2018-12-02 03:17:08,969 INFO L796 eck$LassoCheckResult]: Loop: 97#L537-1true assume !false; 49#L538true start_simulation_~kernel_st~0 := 1;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; 76#L386true assume !true; 103#L402true start_simulation_~kernel_st~0 := 2; 62#L287-1true start_simulation_~kernel_st~0 := 3; 102#L413true 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 112#L107-6true assume 1 == ~P_1_pc~0; 81#L108-2true assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 124#L118-2true is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 83#L119-2true activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 156#L467-6true assume !(0 != activate_threads_~tmp~1); 162#L467-8true havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 163#L175-6true assume !(1 == ~P_2_pc~0); 160#L175-8true is_P_2_triggered_~__retres1~1 := 0; 28#L186-2true is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 138#L187-2true activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11#L475-6true assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 168#L475-8true havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 34#L257-6true assume 1 == ~C_1_pc~0; 169#L258-2true assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 101#L278-2true is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 69#L279-2true activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21#L483-6true assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 29#L483-8true havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 90#L317-1true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 57#L334-1true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 155#L335-1true start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 117#L556true assume !(0 == start_simulation_~tmp~3); 120#L556-1true 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 93#L317-2true assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 60#L334-2true exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 158#L335-2true stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 14#L511true assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 92#L518true stop_simulation_#res := stop_simulation_~__retres2~0; 24#L519true start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 153#L569true assume !(0 != start_simulation_~tmp___0~2); 97#L537-1true [2018-12-02 03:17:08,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:08,972 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-12-02 03:17:08,973 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:08,974 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,001 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,001 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,052 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,053 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,054 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:09,056 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:17:09,056 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,057 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2018-12-02 03:17:09,057 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,057 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,057 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,057 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,063 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,063 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,063 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:17:09,064 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:09,074 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:09,075 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 3 states. [2018-12-02 03:17:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,099 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2018-12-02 03:17:09,100 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:09,101 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2018-12-02 03:17:09,104 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-12-02 03:17:09,109 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2018-12-02 03:17:09,110 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-12-02 03:17:09,110 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-12-02 03:17:09,111 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2018-12-02 03:17:09,112 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,112 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-12-02 03:17:09,123 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2018-12-02 03:17:09,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-02 03:17:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-02 03:17:09,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2018-12-02 03:17:09,134 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-12-02 03:17:09,134 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-12-02 03:17:09,134 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-12-02 03:17:09,134 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2018-12-02 03:17:09,135 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-12-02 03:17:09,135 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,136 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,136 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] [2018-12-02 03:17:09,136 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] [2018-12-02 03:17:09,136 INFO L794 eck$LassoCheckResult]: Stem: 510#ULTIMATE.startENTRY ~max_loop~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; 387#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 388#L589 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; 481#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 482#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 393#L299-1 assume !(1 == ~C_1_i~0);~C_1_st~0 := 2; 394#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 448#L107 assume !(1 == ~P_1_pc~0); 497#L107-2 is_P_1_triggered_~__retres1~0 := 0; 496#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 498#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 499#L467 assume !(0 != activate_threads_~tmp~1); 525#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 360#L175 assume 1 == ~P_2_pc~0; 361#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 363#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 364#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 412#L475 assume !(0 != activate_threads_~tmp___0~1); 365#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 366#L257 assume 1 == ~C_1_pc~0; 471#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 472#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 473#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 417#L483 assume !(0 != activate_threads_~tmp___1~1); 418#L537-1 [2018-12-02 03:17:09,137 INFO L796 eck$LassoCheckResult]: Loop: 418#L537-1 assume !false; 446#L538 start_simulation_~kernel_st~0 := 1;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; 447#L386 assume !false; 475#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 494#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 372#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 450#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 435#L351 assume !(0 != eval_~tmp___2~0); 436#L402 start_simulation_~kernel_st~0 := 2; 457#L287-1 start_simulation_~kernel_st~0 := 3; 458#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 502#L107-6 assume 1 == ~P_1_pc~0; 484#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 485#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 487#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 488#L467-6 assume !(0 != activate_threads_~tmp~1); 523#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 524#L175-6 assume 1 == ~P_2_pc~0; 515#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 409#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 410#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 378#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 379#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 419#L257-6 assume 1 == ~C_1_pc~0; 421#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 467#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 468#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 399#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 400#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 411#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 376#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 453#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 504#L556 assume !(0 == start_simulation_~tmp~3); 474#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 500#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 381#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 454#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 383#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 384#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 403#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 404#L569 assume !(0 != start_simulation_~tmp___0~2); 418#L537-1 [2018-12-02 03:17:09,137 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,137 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-12-02 03:17:09,137 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,137 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,137 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,137 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,138 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,156 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,156 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,156 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:09,156 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:17:09,157 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,157 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2018-12-02 03:17:09,157 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,157 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,158 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,158 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,204 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,204 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,204 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,205 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,205 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:09,205 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:09,205 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-12-02 03:17:09,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,212 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2018-12-02 03:17:09,213 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:09,213 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2018-12-02 03:17:09,214 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-12-02 03:17:09,215 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2018-12-02 03:17:09,215 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-12-02 03:17:09,216 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-12-02 03:17:09,216 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2018-12-02 03:17:09,216 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,216 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-12-02 03:17:09,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2018-12-02 03:17:09,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-12-02 03:17:09,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-12-02 03:17:09,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2018-12-02 03:17:09,220 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-12-02 03:17:09,220 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-12-02 03:17:09,220 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-12-02 03:17:09,220 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2018-12-02 03:17:09,221 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-12-02 03:17:09,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,222 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] [2018-12-02 03:17:09,222 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] [2018-12-02 03:17:09,222 INFO L794 eck$LassoCheckResult]: Stem: 853#ULTIMATE.startENTRY ~max_loop~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; 730#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 731#L589 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; 822#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 823#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 732#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 733#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 791#L107 assume !(1 == ~P_1_pc~0); 840#L107-2 is_P_1_triggered_~__retres1~0 := 0; 839#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 841#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 842#L467 assume !(0 != activate_threads_~tmp~1); 868#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 703#L175 assume 1 == ~P_2_pc~0; 704#L176 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 706#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 707#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 752#L475 assume !(0 != activate_threads_~tmp___0~1); 708#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 709#L257 assume 1 == ~C_1_pc~0; 814#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 815#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 816#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 760#L483 assume !(0 != activate_threads_~tmp___1~1); 761#L537-1 [2018-12-02 03:17:09,222 INFO L796 eck$LassoCheckResult]: Loop: 761#L537-1 assume !false; 787#L538 start_simulation_~kernel_st~0 := 1;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; 788#L386 assume !false; 818#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 835#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 715#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 793#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 777#L351 assume !(0 != eval_~tmp___2~0); 778#L402 start_simulation_~kernel_st~0 := 2; 800#L287-1 start_simulation_~kernel_st~0 := 3; 801#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 845#L107-6 assume 1 == ~P_1_pc~0; 826#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 827#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 830#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 831#L467-6 assume !(0 != activate_threads_~tmp~1); 866#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 867#L175-6 assume 1 == ~P_2_pc~0; 858#L176-2 assume 1 == ~P_2_ev~0;is_P_2_triggered_~__retres1~1 := 1; 753#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 754#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 721#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 722#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 762#L257-6 assume 1 == ~C_1_pc~0; 764#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 810#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 811#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 742#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 743#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 755#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 719#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 796#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 847#L556 assume !(0 == start_simulation_~tmp~3); 817#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 843#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 726#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 799#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 728#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 729#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 748#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 749#L569 assume !(0 != start_simulation_~tmp___0~2); 761#L537-1 [2018-12-02 03:17:09,223 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,223 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-12-02 03:17:09,223 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,223 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,223 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,223 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,239 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,239 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,239 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:09,239 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:17:09,240 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,240 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2018-12-02 03:17:09,240 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,240 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,240 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,240 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,265 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,265 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:09,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:09,265 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 3 states. [2018-12-02 03:17:09,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,294 INFO L93 Difference]: Finished difference Result 301 states and 442 transitions. [2018-12-02 03:17:09,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:09,294 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 442 transitions. [2018-12-02 03:17:09,295 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2018-12-02 03:17:09,297 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 301 states and 442 transitions. [2018-12-02 03:17:09,297 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2018-12-02 03:17:09,298 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2018-12-02 03:17:09,298 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 442 transitions. [2018-12-02 03:17:09,299 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,299 INFO L705 BuchiCegarLoop]: Abstraction has 301 states and 442 transitions. [2018-12-02 03:17:09,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 442 transitions. [2018-12-02 03:17:09,307 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 286. [2018-12-02 03:17:09,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-12-02 03:17:09,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2018-12-02 03:17:09,308 INFO L728 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-12-02 03:17:09,308 INFO L608 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-12-02 03:17:09,308 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-12-02 03:17:09,308 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 421 transitions. [2018-12-02 03:17:09,309 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2018-12-02 03:17:09,309 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,309 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,310 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] [2018-12-02 03:17:09,310 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] [2018-12-02 03:17:09,310 INFO L794 eck$LassoCheckResult]: Stem: 1330#ULTIMATE.startENTRY ~max_loop~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; 1206#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 1207#L589 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; 1298#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 1299#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 1212#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 1213#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1266#L107 assume !(1 == ~P_1_pc~0); 1316#L107-2 is_P_1_triggered_~__retres1~0 := 0; 1315#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1317#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1318#L467 assume !(0 != activate_threads_~tmp~1); 1353#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1180#L175 assume !(1 == ~P_2_pc~0); 1181#L175-2 is_P_2_triggered_~__retres1~1 := 0; 1182#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1183#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1230#L475 assume !(0 != activate_threads_~tmp___0~1); 1184#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1185#L257 assume 1 == ~C_1_pc~0; 1290#L258 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1291#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1292#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1235#L483 assume !(0 != activate_threads_~tmp___1~1); 1236#L537-1 [2018-12-02 03:17:09,310 INFO L796 eck$LassoCheckResult]: Loop: 1236#L537-1 assume !false; 1264#L538 start_simulation_~kernel_st~0 := 1;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; 1265#L386 assume !false; 1294#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1313#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1191#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1271#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 1253#L351 assume !(0 != eval_~tmp___2~0); 1254#L402 start_simulation_~kernel_st~0 := 2; 1276#L287-1 start_simulation_~kernel_st~0 := 3; 1277#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 1321#L107-6 assume 1 == ~P_1_pc~0; 1302#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 1303#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 1306#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 1307#L467-6 assume !(0 != activate_threads_~tmp~1); 1348#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 1352#L175-6 assume !(1 == ~P_2_pc~0); 1351#L175-8 is_P_2_triggered_~__retres1~1 := 0; 1228#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 1229#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 1197#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 1198#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 1237#L257-6 assume 1 == ~C_1_pc~0; 1239#L258-2 assume 1 == ~e~0;is_C_1_triggered_~__retres1~2 := 1; 1286#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 1287#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 1218#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 1219#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1227#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1195#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1272#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 1324#L556 assume !(0 == start_simulation_~tmp~3); 1293#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 1319#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 1202#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 1273#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 1204#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 1205#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 1220#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 1221#L569 assume !(0 != start_simulation_~tmp___0~2); 1236#L537-1 [2018-12-02 03:17:09,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,311 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-12-02 03:17:09,311 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,311 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,312 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:09,312 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,330 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,330 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,330 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:09,331 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:17:09,331 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,331 INFO L82 PathProgramCache]: Analyzing trace with hash 481737154, now seen corresponding path program 1 times [2018-12-02 03:17:09,331 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,331 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,332 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,332 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,337 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,353 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,353 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,353 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,353 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,354 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:09,354 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:09,354 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. cyclomatic complexity: 136 Second operand 3 states. [2018-12-02 03:17:09,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,400 INFO L93 Difference]: Finished difference Result 532 states and 764 transitions. [2018-12-02 03:17:09,400 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:09,401 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 764 transitions. [2018-12-02 03:17:09,403 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-12-02 03:17:09,405 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 764 transitions. [2018-12-02 03:17:09,405 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2018-12-02 03:17:09,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2018-12-02 03:17:09,406 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 764 transitions. [2018-12-02 03:17:09,407 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,407 INFO L705 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-12-02 03:17:09,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 764 transitions. [2018-12-02 03:17:09,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2018-12-02 03:17:09,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-12-02 03:17:09,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 744 transitions. [2018-12-02 03:17:09,416 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-12-02 03:17:09,416 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-12-02 03:17:09,416 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-12-02 03:17:09,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 744 transitions. [2018-12-02 03:17:09,418 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 490 [2018-12-02 03:17:09,418 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,418 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,418 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] [2018-12-02 03:17:09,418 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] [2018-12-02 03:17:09,419 INFO L794 eck$LassoCheckResult]: Stem: 2160#ULTIMATE.startENTRY ~max_loop~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; 2033#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 2034#L589 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; 2125#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 2126#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 2035#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 2036#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2093#L107 assume !(1 == ~P_1_pc~0); 2143#L107-2 is_P_1_triggered_~__retres1~0 := 0; 2142#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2144#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2145#L467 assume !(0 != activate_threads_~tmp~1); 2182#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2007#L175 assume !(1 == ~P_2_pc~0); 2008#L175-2 is_P_2_triggered_~__retres1~1 := 0; 2009#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2010#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2055#L475 assume !(0 != activate_threads_~tmp___0~1); 2011#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2012#L257 assume !(1 == ~C_1_pc~0); 2111#L257-2 assume !(2 == ~C_1_pc~0); 2112#L267-1 is_C_1_triggered_~__retres1~2 := 0; 2158#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2119#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2063#L483 assume !(0 != activate_threads_~tmp___1~1); 2064#L537-1 [2018-12-02 03:17:09,419 INFO L796 eck$LassoCheckResult]: Loop: 2064#L537-1 assume !false; 2380#L538 start_simulation_~kernel_st~0 := 1;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; 2376#L386 assume !false; 2375#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2373#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2371#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2369#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 2366#L351 assume !(0 != eval_~tmp___2~0); 2367#L402 start_simulation_~kernel_st~0 := 2; 2463#L287-1 start_simulation_~kernel_st~0 := 3; 2462#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 2461#L107-6 assume 1 == ~P_1_pc~0; 2459#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 2457#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 2454#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 2452#L467-6 assume !(0 != activate_threads_~tmp~1); 2450#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 2448#L175-6 assume !(1 == ~P_2_pc~0); 2446#L175-8 is_P_2_triggered_~__retres1~1 := 0; 2444#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 2443#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 2442#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 2440#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 2065#L257-6 assume !(1 == ~C_1_pc~0); 2066#L257-8 assume !(2 == ~C_1_pc~0); 2504#L267-5 is_C_1_triggered_~__retres1~2 := 0; 2503#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 2502#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 2501#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 2499#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2493#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2491#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2490#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 2489#L556 assume !(0 == start_simulation_~tmp~3); 2487#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 2484#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 2483#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 2481#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 2479#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 2477#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 2474#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 2472#L569 assume !(0 != start_simulation_~tmp___0~2); 2064#L537-1 [2018-12-02 03:17:09,419 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,419 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-12-02 03:17:09,419 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,419 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,420 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,420 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,442 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,442 INFO L82 PathProgramCache]: Analyzing trace with hash 290270835, now seen corresponding path program 1 times [2018-12-02 03:17:09,442 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,442 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,443 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,476 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,476 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,476 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,477 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,477 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:17:09,477 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:17:09,477 INFO L87 Difference]: Start difference. First operand 516 states and 744 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-12-02 03:17:09,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,532 INFO L93 Difference]: Finished difference Result 908 states and 1298 transitions. [2018-12-02 03:17:09,533 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 03:17:09,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1298 transitions. [2018-12-02 03:17:09,538 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 882 [2018-12-02 03:17:09,542 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1298 transitions. [2018-12-02 03:17:09,542 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2018-12-02 03:17:09,543 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2018-12-02 03:17:09,543 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1298 transitions. [2018-12-02 03:17:09,544 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,544 INFO L705 BuchiCegarLoop]: Abstraction has 908 states and 1298 transitions. [2018-12-02 03:17:09,545 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1298 transitions. [2018-12-02 03:17:09,552 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 528. [2018-12-02 03:17:09,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-12-02 03:17:09,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 756 transitions. [2018-12-02 03:17:09,554 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-12-02 03:17:09,554 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-12-02 03:17:09,554 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-12-02 03:17:09,554 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 756 transitions. [2018-12-02 03:17:09,555 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 502 [2018-12-02 03:17:09,555 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,555 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,556 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] [2018-12-02 03:17:09,556 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-12-02 03:17:09,556 INFO L794 eck$LassoCheckResult]: Stem: 3609#ULTIMATE.startENTRY ~max_loop~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; 3473#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 3474#L589 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; 3567#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 3568#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 3475#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 3476#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3532#L107 assume !(1 == ~P_1_pc~0); 3585#L107-2 is_P_1_triggered_~__retres1~0 := 0; 3584#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3586#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3587#L467 assume !(0 != activate_threads_~tmp~1); 3635#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3447#L175 assume !(1 == ~P_2_pc~0); 3448#L175-2 is_P_2_triggered_~__retres1~1 := 0; 3449#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3450#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3495#L475 assume !(0 != activate_threads_~tmp___0~1); 3451#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3452#L257 assume !(1 == ~C_1_pc~0); 3550#L257-2 assume !(2 == ~C_1_pc~0); 3551#L267-1 is_C_1_triggered_~__retres1~2 := 0; 3607#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3561#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3505#L483 assume !(0 != activate_threads_~tmp___1~1); 3506#L537-1 [2018-12-02 03:17:09,557 INFO L796 eck$LassoCheckResult]: Loop: 3506#L537-1 assume !false; 3789#L538 start_simulation_~kernel_st~0 := 1;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; 3759#L386 assume !false; 3728#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3724#L317 assume !(0 == ~P_1_st~0); 3720#L321 assume !(0 == ~P_2_st~0); 3715#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 3708#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3704#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 3702#L351 assume !(0 != eval_~tmp___2~0); 3701#L402 start_simulation_~kernel_st~0 := 2; 3700#L287-1 start_simulation_~kernel_st~0 := 3; 3699#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 3698#L107-6 assume 1 == ~P_1_pc~0; 3696#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 3695#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 3694#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 3693#L467-6 assume !(0 != activate_threads_~tmp~1); 3692#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 3690#L175-6 assume !(1 == ~P_2_pc~0); 3691#L175-8 is_P_2_triggered_~__retres1~1 := 0; 3664#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 3665#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 3655#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 3656#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 3507#L257-6 assume !(1 == ~C_1_pc~0); 3508#L257-8 assume !(2 == ~C_1_pc~0); 3531#L267-5 is_C_1_triggered_~__retres1~2 := 0; 3592#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 3555#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 3556#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 3498#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3499#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3943#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3626#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 3601#L556 assume !(0 == start_simulation_~tmp~3); 3562#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 3589#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 3469#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 3542#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 3471#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 3472#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 3491#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 3492#L569 assume !(0 != start_simulation_~tmp___0~2); 3506#L537-1 [2018-12-02 03:17:09,557 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,557 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-12-02 03:17:09,557 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,557 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,558 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,558 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,571 INFO L82 PathProgramCache]: Analyzing trace with hash -303364692, now seen corresponding path program 1 times [2018-12-02 03:17:09,571 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,572 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,572 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,572 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:09,573 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,589 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:09,590 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:09,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:09,590 INFO L87 Difference]: Start difference. First operand 528 states and 756 transitions. cyclomatic complexity: 229 Second operand 3 states. [2018-12-02 03:17:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,618 INFO L93 Difference]: Finished difference Result 922 states and 1296 transitions. [2018-12-02 03:17:09,618 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:09,618 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 922 states and 1296 transitions. [2018-12-02 03:17:09,623 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-12-02 03:17:09,627 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 922 states to 922 states and 1296 transitions. [2018-12-02 03:17:09,627 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2018-12-02 03:17:09,628 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2018-12-02 03:17:09,628 INFO L73 IsDeterministic]: Start isDeterministic. Operand 922 states and 1296 transitions. [2018-12-02 03:17:09,629 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,629 INFO L705 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-12-02 03:17:09,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states and 1296 transitions. [2018-12-02 03:17:09,641 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2018-12-02 03:17:09,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-12-02 03:17:09,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1296 transitions. [2018-12-02 03:17:09,644 INFO L728 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-12-02 03:17:09,644 INFO L608 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-12-02 03:17:09,644 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-12-02 03:17:09,644 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 1296 transitions. [2018-12-02 03:17:09,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-12-02 03:17:09,648 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,648 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,649 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] [2018-12-02 03:17:09,649 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-12-02 03:17:09,649 INFO L794 eck$LassoCheckResult]: Stem: 5061#ULTIMATE.startENTRY ~max_loop~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; 4929#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 4930#L589 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; 5024#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 5025#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 4935#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 4936#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 4987#L107 assume !(1 == ~P_1_pc~0); 5040#L107-2 is_P_1_triggered_~__retres1~0 := 0; 5039#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5041#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5042#L467 assume !(0 != activate_threads_~tmp~1); 5087#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 4903#L175 assume !(1 == ~P_2_pc~0); 4904#L175-2 is_P_2_triggered_~__retres1~1 := 0; 4905#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 4906#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 4953#L475 assume !(0 != activate_threads_~tmp___0~1); 4907#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 4908#L257 assume !(1 == ~C_1_pc~0); 5005#L257-2 assume !(2 == ~C_1_pc~0); 5006#L267-1 is_C_1_triggered_~__retres1~2 := 0; 5059#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5015#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 4958#L483 assume !(0 != activate_threads_~tmp___1~1); 4959#L537-1 [2018-12-02 03:17:09,650 INFO L796 eck$LassoCheckResult]: Loop: 4959#L537-1 assume !false; 5308#L538 start_simulation_~kernel_st~0 := 1;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; 5306#L386 assume !false; 5304#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5300#L317 assume !(0 == ~P_1_st~0); 5301#L321 assume !(0 == ~P_2_st~0); 5625#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 5623#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5622#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 5621#L351 assume !(0 != eval_~tmp___2~0); 5619#L402 start_simulation_~kernel_st~0 := 2; 5616#L287-1 start_simulation_~kernel_st~0 := 3; 5615#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 5611#L107-6 assume 1 == ~P_1_pc~0; 5609#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 5372#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 5371#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 5368#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 5366#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 5363#L175-6 assume !(1 == ~P_2_pc~0); 5361#L175-8 is_P_2_triggered_~__retres1~1 := 0; 5359#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 5357#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 5355#L475-6 assume 0 != activate_threads_~tmp___0~1;~P_2_st~0 := 0; 5353#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 5351#L257-6 assume !(1 == ~C_1_pc~0); 5349#L257-8 assume !(2 == ~C_1_pc~0); 5347#L267-5 is_C_1_triggered_~__retres1~2 := 0; 5345#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 5343#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 5341#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 5339#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5336#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5334#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5330#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 5326#L556 assume !(0 == start_simulation_~tmp~3); 5324#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 5318#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 5316#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 5315#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 5314#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 5313#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 5312#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 5311#L569 assume !(0 != start_simulation_~tmp___0~2); 4959#L537-1 [2018-12-02 03:17:09,650 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,650 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-12-02 03:17:09,650 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,650 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,651 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,651 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,662 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,662 INFO L82 PathProgramCache]: Analyzing trace with hash 2068374570, now seen corresponding path program 1 times [2018-12-02 03:17:09,663 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,663 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,663 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,663 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:09,664 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,713 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,713 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:17:09,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:17:09,714 INFO L87 Difference]: Start difference. First operand 922 states and 1296 transitions. cyclomatic complexity: 375 Second operand 5 states. [2018-12-02 03:17:09,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,771 INFO L93 Difference]: Finished difference Result 2050 states and 2879 transitions. [2018-12-02 03:17:09,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:17:09,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2879 transitions. [2018-12-02 03:17:09,777 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2024 [2018-12-02 03:17:09,786 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2879 transitions. [2018-12-02 03:17:09,786 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2018-12-02 03:17:09,787 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2018-12-02 03:17:09,788 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2879 transitions. [2018-12-02 03:17:09,790 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,790 INFO L705 BuchiCegarLoop]: Abstraction has 2050 states and 2879 transitions. [2018-12-02 03:17:09,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2879 transitions. [2018-12-02 03:17:09,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 958. [2018-12-02 03:17:09,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-12-02 03:17:09,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1323 transitions. [2018-12-02 03:17:09,805 INFO L728 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-12-02 03:17:09,806 INFO L608 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-12-02 03:17:09,806 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-12-02 03:17:09,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1323 transitions. [2018-12-02 03:17:09,808 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 932 [2018-12-02 03:17:09,809 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,809 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,809 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] [2018-12-02 03:17:09,809 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-12-02 03:17:09,810 INFO L794 eck$LassoCheckResult]: Stem: 8058#ULTIMATE.startENTRY ~max_loop~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; 7915#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 7916#L589 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; 8009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 8010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 7917#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 7918#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 7973#L107 assume !(1 == ~P_1_pc~0); 8028#L107-2 is_P_1_triggered_~__retres1~0 := 0; 8027#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8030#L467 assume !(0 != activate_threads_~tmp~1); 8096#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 7889#L175 assume !(1 == ~P_2_pc~0); 7890#L175-2 is_P_2_triggered_~__retres1~1 := 0; 7891#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 7892#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 7936#L475 assume !(0 != activate_threads_~tmp___0~1); 7893#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 7894#L257 assume !(1 == ~C_1_pc~0); 7992#L257-2 assume !(2 == ~C_1_pc~0); 7993#L267-1 is_C_1_triggered_~__retres1~2 := 0; 8056#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8003#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 7945#L483 assume !(0 != activate_threads_~tmp___1~1); 7946#L537-1 [2018-12-02 03:17:09,810 INFO L796 eck$LassoCheckResult]: Loop: 7946#L537-1 assume !false; 8392#L538 start_simulation_~kernel_st~0 := 1;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; 8389#L386 assume !false; 8388#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8387#L317 assume !(0 == ~P_1_st~0); 7899#L321 assume !(0 == ~P_2_st~0); 7901#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 7975#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 7976#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 8815#L351 assume !(0 != eval_~tmp___2~0); 8038#L402 start_simulation_~kernel_st~0 := 2; 7985#L287-1 start_simulation_~kernel_st~0 := 3; 7986#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 8037#L107-6 assume 1 == ~P_1_pc~0; 8149#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 8150#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 8287#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 8082#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 8084#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 8275#L175-6 assume !(1 == ~P_2_pc~0); 8274#L175-8 is_P_2_triggered_~__retres1~1 := 0; 8273#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 8272#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 8271#L475-6 assume !(0 != activate_threads_~tmp___0~1); 8270#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 8269#L257-6 assume !(1 == ~C_1_pc~0); 8268#L257-8 assume !(2 == ~C_1_pc~0); 8254#L267-5 is_C_1_triggered_~__retres1~2 := 0; 8255#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 8244#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 8245#L483-6 assume 0 != activate_threads_~tmp___1~1;~C_1_st~0 := 0; 8236#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8237#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8409#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8407#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 8404#L556 assume !(0 == start_simulation_~tmp~3); 8402#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 8401#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 8400#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 8399#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 8398#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 8397#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 8396#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 8395#L569 assume !(0 != start_simulation_~tmp___0~2); 7946#L537-1 [2018-12-02 03:17:09,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,810 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-12-02 03:17:09,810 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,810 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,811 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,820 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,820 INFO L82 PathProgramCache]: Analyzing trace with hash -1803890900, now seen corresponding path program 1 times [2018-12-02 03:17:09,820 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,820 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,821 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:09,821 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,855 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,855 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:09,855 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:09,855 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:17:09,855 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:17:09,856 INFO L87 Difference]: Start difference. First operand 958 states and 1323 transitions. cyclomatic complexity: 366 Second operand 5 states. [2018-12-02 03:17:09,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:09,928 INFO L93 Difference]: Finished difference Result 2024 states and 2800 transitions. [2018-12-02 03:17:09,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:17:09,929 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2800 transitions. [2018-12-02 03:17:09,934 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1998 [2018-12-02 03:17:09,938 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2024 states and 2800 transitions. [2018-12-02 03:17:09,938 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2024 [2018-12-02 03:17:09,939 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2024 [2018-12-02 03:17:09,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2024 states and 2800 transitions. [2018-12-02 03:17:09,941 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:09,941 INFO L705 BuchiCegarLoop]: Abstraction has 2024 states and 2800 transitions. [2018-12-02 03:17:09,942 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states and 2800 transitions. [2018-12-02 03:17:09,951 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 988. [2018-12-02 03:17:09,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-02 03:17:09,953 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1342 transitions. [2018-12-02 03:17:09,953 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-12-02 03:17:09,953 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-12-02 03:17:09,953 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-12-02 03:17:09,953 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1342 transitions. [2018-12-02 03:17:09,955 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-12-02 03:17:09,955 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:09,955 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:09,956 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] [2018-12-02 03:17:09,956 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-12-02 03:17:09,956 INFO L794 eck$LassoCheckResult]: Stem: 11064#ULTIMATE.startENTRY ~max_loop~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; 10912#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 10913#L589 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; 11011#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 11012#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 10914#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 10915#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 10974#L107 assume !(1 == ~P_1_pc~0); 11029#L107-2 is_P_1_triggered_~__retres1~0 := 0; 11028#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11030#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11031#L467 assume !(0 != activate_threads_~tmp~1); 11102#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 10885#L175 assume !(1 == ~P_2_pc~0); 10886#L175-2 is_P_2_triggered_~__retres1~1 := 0; 10887#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 10888#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 10933#L475 assume !(0 != activate_threads_~tmp___0~1); 10889#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10890#L257 assume !(1 == ~C_1_pc~0); 10993#L257-2 assume !(2 == ~C_1_pc~0); 10994#L267-1 is_C_1_triggered_~__retres1~2 := 0; 11061#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11005#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 10942#L483 assume !(0 != activate_threads_~tmp___1~1); 10943#L537-1 [2018-12-02 03:17:09,956 INFO L796 eck$LassoCheckResult]: Loop: 10943#L537-1 assume !false; 11780#L538 start_simulation_~kernel_st~0 := 1;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; 11676#L386 assume !false; 11778#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11775#L317 assume !(0 == ~P_1_st~0); 10895#L321 assume !(0 == ~P_2_st~0); 10897#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 11048#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11774#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 11767#L351 assume !(0 != eval_~tmp___2~0); 11044#L402 start_simulation_~kernel_st~0 := 2; 10986#L287-1 start_simulation_~kernel_st~0 := 3; 10987#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 11043#L107-6 assume 1 == ~P_1_pc~0; 11398#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 11397#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 11396#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 11395#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 11394#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 11393#L175-6 assume !(1 == ~P_2_pc~0); 11392#L175-8 is_P_2_triggered_~__retres1~1 := 0; 11391#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 11390#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 11389#L475-6 assume !(0 != activate_threads_~tmp___0~1); 11388#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 10944#L257-6 assume !(1 == ~C_1_pc~0); 10945#L257-8 assume !(2 == ~C_1_pc~0); 11386#L267-5 is_C_1_triggered_~__retres1~2 := 0; 11384#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 11382#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 11380#L483-6 assume !(0 != activate_threads_~tmp___1~1); 11378#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11374#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11375#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11370#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 11371#L556 assume !(0 == start_simulation_~tmp~3); 11789#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 11787#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 11786#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 11785#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 11784#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 11783#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 11782#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 11781#L569 assume !(0 != start_simulation_~tmp___0~2); 10943#L537-1 [2018-12-02 03:17:09,956 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,956 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-12-02 03:17:09,956 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,957 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,957 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,957 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,965 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,965 INFO L82 PathProgramCache]: Analyzing trace with hash 1479959146, now seen corresponding path program 1 times [2018-12-02 03:17:09,965 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,965 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:09,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:09,974 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:09,975 INFO L82 PathProgramCache]: Analyzing trace with hash -1057551404, now seen corresponding path program 1 times [2018-12-02 03:17:09,975 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:09,975 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:09,975 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,975 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:09,976 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:09,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:09,987 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:09,987 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:10,115 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-12-02 03:17:10,168 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:17:10,169 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:17:10,169 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:17:10,169 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:17:10,169 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-12-02 03:17:10,169 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,169 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:17:10,169 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:17:10,169 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-12-02 03:17:10,169 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:17:10,169 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:17:10,183 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,185 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,201 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,203 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,209 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,210 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,211 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,215 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,218 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,223 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,224 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,226 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,230 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,235 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,237 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,240 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,258 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,407 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:17:10,408 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,411 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,411 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,416 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,416 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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) Waiting until toolchain timeout for monitored process 3 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,439 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,440 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,444 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,444 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,465 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,465 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,468 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,468 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,483 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,483 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,487 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,487 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_P_2_triggered_~__retres1~1=0, ULTIMATE.start_is_P_2_triggered_#res=0} Honda state: {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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,510 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,510 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,512 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,512 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Honda state: {ULTIMATE.start_is_C_1_triggered_~__retres1~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,528 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,528 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,531 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,531 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,547 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,547 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,550 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,550 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,565 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,566 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,568 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,568 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,584 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,585 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,587 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,587 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,602 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,603 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,605 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,605 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,620 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,621 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,622 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,622 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,638 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,638 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,640 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,640 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,655 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,655 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,657 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,657 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,673 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,673 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,675 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,675 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,690 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,690 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,692 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,692 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_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,707 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,708 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,710 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,710 INFO L448 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Honda state: {ULTIMATE.start_stop_simulation_#res=0, ULTIMATE.start_start_simulation_~tmp___0~2=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/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-12-02 03:17:10,725 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,725 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,727 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,727 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_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/z3 Starting monitored process 19 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 19 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,742 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,742 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,744 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-12-02 03:17:10,744 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_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/z3 Starting monitored process 20 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 20 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,759 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-12-02 03:17:10,759 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/z3 Starting monitored process 21 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 21 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,776 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-12-02 03:17:10,776 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-12-02 03:17:10,797 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-12-02 03:17:10,798 INFO L216 LassoAnalysis]: Preferences: [2018-12-02 03:17:10,798 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-12-02 03:17:10,798 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-12-02 03:17:10,798 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-12-02 03:17:10,798 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-12-02 03:17:10,798 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-12-02 03:17:10,798 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-12-02 03:17:10,798 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-12-02 03:17:10,798 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-12-02 03:17:10,798 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-12-02 03:17:10,799 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-12-02 03:17:10,800 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,802 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,804 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,805 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,807 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,811 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,812 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,813 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,814 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,815 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,819 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,820 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,821 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,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-12-02 03:17:10,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,824 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,826 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,831 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,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-12-02 03:17:10,835 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,837 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,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-12-02 03:17:10,844 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,845 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,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-12-02 03:17:10,849 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:10,851 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-12-02 03:17:11,023 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-12-02 03:17:11,027 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-12-02 03:17:11,028 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,029 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,029 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,029 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,029 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,029 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,030 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,031 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,032 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,033 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,033 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,033 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,033 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,033 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,033 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,033 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,035 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,035 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,035 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,035 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,035 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,036 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,036 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,036 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,036 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,037 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,037 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,037 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,037 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,037 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,037 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,038 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,038 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,039 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,039 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,039 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,039 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,039 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,039 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,039 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,041 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,041 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,041 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,041 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,041 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,041 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,042 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,042 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,042 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,042 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,043 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,043 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,043 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,043 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,044 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,044 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,044 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,044 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,045 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,045 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,046 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,046 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,046 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,046 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,046 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,046 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,046 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,047 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,047 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,047 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,048 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,048 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,048 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,048 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,048 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,049 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,049 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,049 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,049 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,049 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,049 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,049 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,049 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,050 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,051 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,051 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,052 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,052 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,052 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,052 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,052 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,052 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,053 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,053 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,053 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,054 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,054 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,054 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,054 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,055 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,055 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,055 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,055 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,055 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,055 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,056 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,056 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,056 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,056 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,057 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,057 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,057 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,057 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,057 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,057 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,058 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,058 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,058 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,058 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,058 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,058 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,058 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,059 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,059 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,060 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,060 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,060 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,060 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,060 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,060 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,060 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,061 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,062 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,062 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,062 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,062 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,064 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,064 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,064 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,064 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,064 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,064 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,065 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,065 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,065 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,066 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,066 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,066 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,066 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,067 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,067 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,067 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,067 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,067 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,067 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,068 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,068 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,068 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,068 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,069 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,069 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,069 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,069 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,069 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,069 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,069 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,070 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,070 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,070 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,070 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,070 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,071 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,071 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,072 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,072 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,072 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,072 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,072 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,073 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,073 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,073 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,074 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,074 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,074 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,074 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,074 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,075 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,075 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,076 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,076 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,076 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,076 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,076 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,076 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,078 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,078 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,078 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,078 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,079 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,079 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,079 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,079 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,079 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,079 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,079 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,080 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,080 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,080 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,080 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,080 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,081 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,081 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,081 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,081 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,081 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,082 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,082 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,082 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,082 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,082 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,082 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,082 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-12-02 03:17:11,083 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-12-02 03:17:11,083 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,083 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-12-02 03:17:11,084 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,084 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,084 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,084 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,084 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,085 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,085 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,085 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,086 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,086 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,086 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,086 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,086 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,087 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,087 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,088 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,088 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,088 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,088 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,088 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,088 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,089 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,089 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,089 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,089 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,089 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,089 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,090 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,090 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,091 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,091 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,091 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,091 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,091 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,093 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,094 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,094 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,094 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,094 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,094 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,094 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,094 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,095 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,095 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,095 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,096 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,096 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,096 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,096 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,096 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,097 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,097 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,097 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,097 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,097 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,097 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,098 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,098 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,098 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,098 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,098 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,099 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,099 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,099 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,100 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,100 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,100 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,100 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,100 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,100 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,101 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,101 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,101 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,102 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,102 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,102 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,103 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,103 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,103 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,103 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,103 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,104 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,104 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,104 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,104 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,104 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,105 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,105 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,105 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,105 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,106 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,106 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,106 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,107 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,107 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,107 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,107 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,107 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,107 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,107 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,108 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,108 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,108 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,109 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,109 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,109 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,109 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,109 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,110 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,110 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,110 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,111 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,111 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,111 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,111 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,111 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,112 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,112 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,112 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,112 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,113 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,113 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,113 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,113 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,113 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,113 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,113 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,115 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,116 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,116 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,116 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,116 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,116 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,116 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,116 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,117 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,117 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,117 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,117 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,117 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,117 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,118 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,118 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,119 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,119 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,119 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,119 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,119 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,120 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,120 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,120 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,120 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,120 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,120 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,120 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,121 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,121 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,122 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,122 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,122 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,122 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,122 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,122 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,123 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,123 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,123 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,124 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,124 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,124 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,124 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,124 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,124 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,125 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,125 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,125 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,125 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,125 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,125 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,125 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,125 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,127 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,127 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,127 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,128 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,128 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,128 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,128 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,128 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,128 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,129 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,129 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,130 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,130 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,130 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,130 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,131 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,131 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,132 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,132 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,132 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,133 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,133 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,133 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,133 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,133 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,133 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,135 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,135 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,135 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,135 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,135 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,135 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,136 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,136 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-12-02 03:17:11,136 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,136 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,137 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,137 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,137 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,138 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,138 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,138 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,138 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,138 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,138 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,138 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,139 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,140 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,140 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,140 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,140 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,140 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,140 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,141 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,141 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,141 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,141 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,141 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,142 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,142 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,142 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,142 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,142 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,142 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,143 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,143 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,143 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,143 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,143 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,143 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,143 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,144 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,144 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,146 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,146 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,146 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,146 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,147 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,147 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,147 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,147 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,148 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,148 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,148 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,148 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,148 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,148 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,148 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,149 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,149 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,149 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,150 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,150 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,151 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,151 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,151 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,151 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,151 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,152 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,152 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,152 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,153 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,153 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,153 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,153 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,154 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,154 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,154 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,154 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,154 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,154 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,154 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,155 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,155 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,155 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,155 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,155 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,155 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,156 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,156 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,156 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,157 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,157 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,158 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,158 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,158 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,158 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,158 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,159 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,159 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,160 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,160 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,160 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,161 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,161 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,161 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,161 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,161 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,161 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,161 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,161 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,162 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,162 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,162 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,163 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,163 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,163 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,163 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,163 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,164 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,164 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,164 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,164 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,164 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,164 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,164 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,165 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,165 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,174 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,174 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,174 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,174 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,175 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,175 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,175 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,177 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,178 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,178 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,178 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,178 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,178 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,179 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,179 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,180 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,180 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,180 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,180 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,181 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,181 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,191 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,191 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,191 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,192 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,192 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,193 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,193 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,193 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,193 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,193 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,193 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,193 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,194 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,195 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,195 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,195 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,195 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,196 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,196 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,197 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,197 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,197 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,210 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,212 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,212 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,212 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,212 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,212 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,213 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,214 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,214 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,215 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,215 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,215 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,225 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,225 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,225 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,226 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,226 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,227 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,227 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,228 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,228 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,228 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,228 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,229 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,229 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,229 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-12-02 03:17:11,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-12-02 03:17:11,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,243 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,244 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,244 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,244 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,245 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,245 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,245 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,245 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,247 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,247 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,248 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,248 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,248 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,249 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,249 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,249 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,249 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,249 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,263 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,263 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,263 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,263 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,263 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,264 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,264 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,266 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,266 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,267 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,267 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,267 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,268 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,268 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,268 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,268 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,268 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,268 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,268 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,268 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,269 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,269 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,279 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,280 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,280 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,280 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,280 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,281 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,281 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,281 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,281 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,282 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,283 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,283 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,283 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,283 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,283 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,284 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,284 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,299 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,299 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,299 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,299 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,300 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,300 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,300 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,301 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,301 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,301 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,302 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,302 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,302 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,302 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,303 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,303 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,303 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,304 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,304 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,304 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,304 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,304 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,304 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,304 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,318 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,319 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,319 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,319 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,319 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,319 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,319 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,320 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,321 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,321 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,321 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,321 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,322 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,322 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,322 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,322 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,322 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,322 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,322 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,322 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,323 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,323 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,336 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,336 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,337 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,337 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,337 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,337 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,338 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,338 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,338 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,338 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,338 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,338 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,339 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,341 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,341 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,341 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,342 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,342 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,343 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,343 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,356 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,357 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,357 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,357 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,358 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,358 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,358 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,358 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,358 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,358 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,359 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,359 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,360 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,360 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,360 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,360 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,360 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,361 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,361 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,361 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,361 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,361 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,362 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,377 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,378 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,378 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,378 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,378 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,378 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,378 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,379 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,379 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,379 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,379 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,379 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,380 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,380 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,382 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,382 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,383 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,383 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,383 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,383 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,383 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,383 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,395 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,395 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,395 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,395 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,395 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,396 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,396 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,396 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,397 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,397 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,397 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,397 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,397 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,397 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,398 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,398 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,398 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,398 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,398 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,398 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,398 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,398 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,399 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,399 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,400 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-12-02 03:17:11,400 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,413 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,413 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,413 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,414 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-12-02 03:17:11,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,414 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,414 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,414 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,415 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,415 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,415 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,416 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,416 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,416 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,416 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,417 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,417 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,420 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,420 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,420 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,420 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,420 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,434 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,434 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,435 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,436 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,436 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,436 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,437 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,437 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,437 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,438 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,438 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,438 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,443 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,454 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,454 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,454 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,455 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,455 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,455 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,455 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,456 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,456 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,456 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,456 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,456 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,456 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,456 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,457 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,457 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,457 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,457 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,457 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,457 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,457 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,457 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,458 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,458 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,458 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,458 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,459 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,459 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,459 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,476 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,477 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,479 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,479 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,479 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,479 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,479 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,480 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,480 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,481 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,481 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,482 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,482 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,482 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,482 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,493 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,494 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,494 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,495 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,495 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,495 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,495 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,496 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,496 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,497 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,497 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,497 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,497 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,497 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,497 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,497 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,497 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,498 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,498 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,498 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,498 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,514 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,514 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,514 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,514 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,515 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,515 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,515 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,515 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,516 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,516 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,516 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,516 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,516 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,516 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,516 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,517 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,517 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,517 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,517 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,517 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,517 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,517 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,517 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,518 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,518 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,518 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,538 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,538 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,538 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,538 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,541 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,541 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,541 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,541 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,542 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,545 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,545 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,545 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,545 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,545 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,545 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,545 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,546 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,546 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,546 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,547 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,547 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,559 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,560 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,560 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,560 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,560 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,561 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,561 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,561 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,561 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,561 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,561 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,563 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,564 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,564 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,564 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,564 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,564 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,564 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,564 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:11,565 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,566 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,566 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,567 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,567 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,567 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,581 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,581 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,581 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,581 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,581 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,583 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,583 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,583 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,583 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,584 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,584 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,584 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,584 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,585 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,585 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,585 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,585 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,585 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,585 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,585 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,588 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,589 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,589 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,589 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,589 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,605 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,605 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,605 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,605 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,605 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,607 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,607 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,607 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,607 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,607 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,607 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,607 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,607 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,608 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,608 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,609 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,609 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,609 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,609 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,610 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,610 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,610 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,610 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,610 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,627 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,627 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,627 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,627 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,629 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,629 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:11,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,630 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-12-02 03:17:11,630 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-12-02 03:17:11,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,630 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,630 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-12-02 03:17:11,631 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,631 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,631 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,631 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,631 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,631 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,631 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,631 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,632 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,633 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,633 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,633 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,649 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,649 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,649 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,649 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,649 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,652 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,652 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,652 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,652 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,652 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,653 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,653 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,654 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,654 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,654 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,654 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,654 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,654 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,654 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,655 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,655 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,655 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,656 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,656 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,657 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,657 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,657 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,674 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,678 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,678 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,679 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,679 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,679 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,679 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,679 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,679 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,680 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,681 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,681 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,681 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,681 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,681 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,681 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,681 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,682 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,682 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,682 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,683 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,699 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,699 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,699 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,699 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,699 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,700 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,700 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,701 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,701 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,701 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,701 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,701 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,701 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,701 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,701 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,703 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,704 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,704 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,704 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,704 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,704 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,704 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,704 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,705 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,705 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,721 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,721 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,721 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,722 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,723 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,724 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,724 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,724 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,727 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,727 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,727 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,728 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,728 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,730 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,730 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,730 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,731 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,731 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,741 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,741 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,741 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,741 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,742 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,743 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,744 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,744 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,744 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,744 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,745 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,745 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,745 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,745 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,745 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,747 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,747 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,747 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,747 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,747 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,748 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,748 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,748 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,748 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,748 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,750 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,750 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,750 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,750 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,750 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,760 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,760 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,760 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,761 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,761 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,762 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,762 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,763 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,763 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,763 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,763 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,763 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,763 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,764 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,764 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,769 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,769 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,769 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,769 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,770 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,770 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,770 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,771 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,771 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,777 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,778 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,778 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,778 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,778 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,780 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,780 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,780 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,782 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,782 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,783 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,783 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,783 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,783 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,783 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,783 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,784 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,784 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,785 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,786 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,786 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,786 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,786 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,786 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,786 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,787 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,787 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,787 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,792 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,792 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,792 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,793 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,793 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,799 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,799 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,799 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,800 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:11,800 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,804 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,804 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,805 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,805 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,805 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,805 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,805 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,805 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,806 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,806 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,810 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,811 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,811 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,811 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,811 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,811 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,811 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,812 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,812 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,814 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,815 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,819 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,819 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,820 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,821 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,821 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,827 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,827 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,828 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,828 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,828 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,829 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,829 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,832 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,833 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,833 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,833 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,833 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,834 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,834 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,834 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,834 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,835 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,837 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,837 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,838 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,838 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,838 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,839 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,839 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,839 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,839 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,839 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,841 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,841 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,842 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,842 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,842 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,842 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,842 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,842 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,843 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,843 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,846 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,847 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,847 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,847 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-12-02 03:17:11,848 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,848 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,848 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,848 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:11,848 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:11,848 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,850 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,850 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-12-02 03:17:11,851 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,851 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,851 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,851 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,860 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,860 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,860 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,861 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,861 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,863 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,863 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,863 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,863 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,864 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,864 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,864 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,864 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,865 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,871 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,871 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,871 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,871 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,872 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,872 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,872 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,872 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,872 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,873 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,873 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,874 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,874 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,874 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,875 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,881 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,882 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,882 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,883 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,884 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,884 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,884 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,885 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,886 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,894 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,894 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,895 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,895 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,895 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,895 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,895 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,895 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,896 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,896 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,897 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,897 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,898 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,898 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,898 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,903 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,903 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,903 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,904 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,904 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,905 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,906 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,906 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,907 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,907 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,909 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,909 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,910 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,910 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,910 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,910 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:11,910 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,912 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:11,912 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,977 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,977 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,978 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,978 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,978 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,978 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,978 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,978 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,979 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,980 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,980 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,980 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,981 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,981 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,981 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,982 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,982 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,983 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,983 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,983 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,983 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,983 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,983 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,984 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,984 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,985 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,986 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,986 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,987 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,987 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,987 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,987 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,988 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,988 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,988 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,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-12-02 03:17:11,989 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,989 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,989 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,989 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,989 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,990 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,990 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,990 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,991 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,991 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,992 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,992 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,992 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,992 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,992 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,992 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,993 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,993 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,994 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,994 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,995 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,995 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,995 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,995 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,995 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,995 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,996 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,996 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:11,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:11,997 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:11,998 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:11,998 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:11,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:11,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:11,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:11,998 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:11,999 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:11,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,000 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,000 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,000 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,000 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,001 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,001 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,001 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,001 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,002 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:12,002 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,008 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,009 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,009 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,009 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,009 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,010 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,010 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,010 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,011 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:12,011 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,020 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,020 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,021 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,021 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,021 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,021 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,021 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,021 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,022 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,022 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,023 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,023 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,024 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,024 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,024 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,025 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,026 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,026 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,026 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,026 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,027 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,027 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,027 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,027 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,028 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:12,028 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,034 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,035 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,035 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,035 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,035 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,036 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,036 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,036 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,037 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-12-02 03:17:12,037 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,043 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,043 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,044 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,044 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,044 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,044 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,044 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,044 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,045 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,045 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,049 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,050 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,050 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,050 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,050 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,050 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,051 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,051 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,051 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,053 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,053 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,053 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,053 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,053 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,053 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,055 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,055 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,064 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,065 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,065 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,065 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,065 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,066 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,066 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,066 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,066 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,070 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,071 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,071 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,071 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,072 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,072 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,072 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,073 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,073 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,074 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,075 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,075 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,075 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,075 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,076 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,076 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,077 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,077 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,078 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,078 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,078 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,078 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,078 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,078 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,079 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,079 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,083 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,084 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,084 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,084 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,084 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,084 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,084 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-12-02 03:17:12,085 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-12-02 03:17:12,085 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,086 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,086 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-12-02 03:17:12,086 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,087 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,087 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,087 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,087 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,087 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,087 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,088 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,088 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,089 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,090 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,090 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,090 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,090 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,091 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,091 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,091 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,091 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,092 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,094 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,095 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,106 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,106 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,106 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,107 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,107 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,109 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,109 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,109 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,109 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,110 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,110 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,110 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,110 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,110 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,110 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,113 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,114 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,114 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,114 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,114 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,114 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,114 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,115 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,115 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,121 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,121 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,121 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,121 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,122 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,129 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,129 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,129 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,129 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,129 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,131 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,132 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,132 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,132 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,132 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,132 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,132 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,133 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,133 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,134 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,135 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,135 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,135 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,136 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,136 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,136 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,138 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,138 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,138 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,138 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,139 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,152 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,152 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,152 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,153 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:12,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,155 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,156 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,156 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,156 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,156 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,156 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,156 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,157 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,157 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,159 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,159 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,159 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,159 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,160 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,160 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,160 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,160 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,160 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,162 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,162 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,162 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,163 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,177 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,177 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,177 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,178 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,178 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,181 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,181 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,182 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,182 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,182 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,182 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,182 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,183 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,185 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,185 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,186 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,186 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,186 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,188 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,188 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,188 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,188 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,189 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,202 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,203 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,203 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,205 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,206 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,206 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,206 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,206 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,208 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,209 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,209 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,209 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,209 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,209 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,211 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,212 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,212 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,212 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,212 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,226 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,226 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,226 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:12,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,229 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,229 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,230 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,230 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,230 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:12,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,235 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,235 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,235 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,236 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,236 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,236 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,236 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,238 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,239 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,252 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,252 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,252 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,253 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,253 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,255 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,255 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,255 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,256 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,256 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,256 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:12,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,258 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,259 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,259 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,259 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,259 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,259 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,259 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,260 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-12-02 03:17:12,260 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,262 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,262 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,262 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,263 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,263 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,277 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,277 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,277 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,277 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,277 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,280 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,280 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,280 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,281 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,281 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,281 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,281 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,281 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,281 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,283 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,283 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,284 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,284 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,284 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,284 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,285 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,285 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,289 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,289 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,290 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,290 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,290 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,302 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,302 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,302 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,305 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,305 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,305 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,305 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,305 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,305 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,306 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,306 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,306 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,308 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,309 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,309 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,309 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,309 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,310 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,310 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,311 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,311 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,312 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,312 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,312 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,326 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,326 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,326 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,327 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,327 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,329 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,329 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,329 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-12-02 03:17:12,330 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,330 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,330 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,330 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-12-02 03:17:12,330 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-12-02 03:17:12,330 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,332 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,332 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-12-02 03:17:12,332 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,332 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,333 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,333 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,333 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,333 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,333 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,334 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,334 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,336 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,336 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,336 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,353 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,360 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,360 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,360 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,360 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,360 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,361 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,361 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,361 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,363 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,364 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,364 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,364 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,364 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,364 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,364 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,365 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,365 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,369 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,369 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,369 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,369 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,377 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,377 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,377 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,378 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,378 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,387 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,388 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,388 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,388 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,388 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,388 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,389 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,389 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,389 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,391 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,391 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,392 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,392 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,392 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,392 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,392 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,392 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,393 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,393 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,395 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,396 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,396 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,406 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,409 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,409 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,410 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,410 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,410 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,410 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,410 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,410 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,411 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:17:12,411 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,414 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,415 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,415 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,415 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,415 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,415 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,416 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,416 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,418 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,418 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,419 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,419 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,419 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,434 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,434 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,435 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,435 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,435 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,437 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,438 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,438 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,438 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,438 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,438 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,438 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,439 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,439 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,439 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,443 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,443 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,443 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,443 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,443 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,444 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,444 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,444 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,444 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,444 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,447 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,447 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,447 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,468 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,469 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,469 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,471 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,471 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,472 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,472 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,472 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,472 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,473 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,475 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,475 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,476 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,476 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,476 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,476 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,476 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,476 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,476 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,478 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,479 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,479 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,479 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,479 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,501 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,503 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,504 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,504 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,504 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,504 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,504 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,504 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,505 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,505 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:17:12,505 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,508 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,509 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,509 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,509 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,509 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,509 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,509 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,510 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:17:12,510 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,517 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,517 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,518 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,518 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,518 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,534 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,535 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,535 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,535 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,535 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,538 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,540 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,540 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,540 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,540 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,540 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,543 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,543 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,543 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,543 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,544 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,544 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,544 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:17:12,544 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,547 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,548 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,548 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,548 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,548 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,566 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,566 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-12-02 03:17:12,566 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,567 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-12-02 03:17:12,567 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,570 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,571 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,571 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,571 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,571 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,571 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,572 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,576 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,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-12-02 03:17:12,577 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,577 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,577 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,577 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,577 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,578 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,578 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,578 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,581 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,581 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,581 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,582 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,582 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,597 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,597 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,597 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,598 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,598 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,608 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,608 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,609 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,609 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,609 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,609 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,609 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,609 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,610 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,610 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,612 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,612 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,612 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,613 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,613 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,613 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,613 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,613 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,613 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,614 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,617 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,617 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,617 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,617 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,626 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,626 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,626 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,627 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,627 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,629 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,629 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,630 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,630 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,630 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,630 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,630 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,630 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,631 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,631 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,633 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,633 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-12-02 03:17:12,634 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-12-02 03:17:12,634 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-12-02 03:17:12,634 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-12-02 03:17:12,634 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-12-02 03:17:12,634 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-12-02 03:17:12,634 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-12-02 03:17:12,635 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-12-02 03:17:12,635 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-12-02 03:17:12,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-12-02 03:17:12,637 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:12,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:12,637 INFO L87 Difference]: Start difference. First operand 988 states and 1342 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-12-02 03:17:12,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:12,683 INFO L93 Difference]: Finished difference Result 988 states and 1326 transitions. [2018-12-02 03:17:12,684 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:12,684 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1326 transitions. [2018-12-02 03:17:12,689 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-12-02 03:17:12,693 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1326 transitions. [2018-12-02 03:17:12,694 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 988 [2018-12-02 03:17:12,695 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 988 [2018-12-02 03:17:12,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1326 transitions. [2018-12-02 03:17:12,696 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:12,696 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-12-02 03:17:12,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1326 transitions. [2018-12-02 03:17:12,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-12-02 03:17:12,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-12-02 03:17:12,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1326 transitions. [2018-12-02 03:17:12,710 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-12-02 03:17:12,710 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-12-02 03:17:12,710 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-12-02 03:17:12,710 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1326 transitions. [2018-12-02 03:17:12,714 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-12-02 03:17:12,714 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:12,714 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:12,715 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] [2018-12-02 03:17:12,715 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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] [2018-12-02 03:17:12,715 INFO L794 eck$LassoCheckResult]: Stem: 13041#ULTIMATE.startENTRY ~max_loop~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; 12895#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 12896#L589 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; 12992#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 12993#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 12899#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 12900#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 12953#L107 assume !(1 == ~P_1_pc~0); 13011#L107-2 is_P_1_triggered_~__retres1~0 := 0; 13010#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13012#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13013#L467 assume !(0 != activate_threads_~tmp~1); 13080#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 12869#L175 assume !(1 == ~P_2_pc~0); 12870#L175-2 is_P_2_triggered_~__retres1~1 := 0; 12871#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12872#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12919#L475 assume !(0 != activate_threads_~tmp___0~1); 12873#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 12874#L257 assume !(1 == ~C_1_pc~0); 12974#L257-2 assume !(2 == ~C_1_pc~0); 12975#L267-1 is_C_1_triggered_~__retres1~2 := 0; 13039#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 12986#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12924#L483 assume !(0 != activate_threads_~tmp___1~1); 12925#L537-1 [2018-12-02 03:17:12,715 INFO L796 eck$LassoCheckResult]: Loop: 12925#L537-1 assume !false; 12951#L538 start_simulation_~kernel_st~0 := 1;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; 12952#L386 assume !false; 12988#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13024#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 13099#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13097#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13095#L351 assume 0 != eval_~tmp___2~0; 13092#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 13057#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 12990#L72 assume 0 == ~P_1_pc~0; 12911#L76 assume !(~i~0 < ~max_loop~0); 12912#L95 ~P_1_st~0 := 2; 12902#L356 assume !(0 == ~P_2_st~0); 13052#L371 assume !(0 == ~C_1_st~0); 13053#L386 assume !false; 13744#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13008#L317 assume !(0 == ~P_1_st~0); 12879#L321 assume !(0 == ~P_2_st~0); 12881#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 13025#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 13808#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 13807#L351 assume !(0 != eval_~tmp___2~0); 13021#L402 start_simulation_~kernel_st~0 := 2; 12967#L287-1 start_simulation_~kernel_st~0 := 3; 12968#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 13020#L107-6 assume 1 == ~P_1_pc~0; 12996#L108-2 assume 1 == ~P_1_ev~0;is_P_1_triggered_~__retres1~0 := 1; 12997#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 13001#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 13002#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 13066#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 13070#L175-6 assume !(1 == ~P_2_pc~0); 13069#L175-8 is_P_2_triggered_~__retres1~1 := 0; 12916#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 12917#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 12886#L475-6 assume !(0 != activate_threads_~tmp___0~1); 12887#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 13843#L257-6 assume !(1 == ~C_1_pc~0); 13842#L257-8 assume !(2 == ~C_1_pc~0); 13841#L267-5 is_C_1_triggered_~__retres1~2 := 0; 13840#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 13839#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 12906#L483-6 assume !(0 != activate_threads_~tmp___1~1); 12907#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 12918#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12960#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12961#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 13029#L556 assume !(0 == start_simulation_~tmp~3); 12987#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 13015#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 12962#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 12963#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 12891#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 12892#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 12909#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 12910#L569 assume !(0 != start_simulation_~tmp___0~2); 12925#L537-1 [2018-12-02 03:17:12,735 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:12,766 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-12-02 03:17:12,766 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:12,766 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:12,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,767 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:12,767 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:12,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:12,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:12,776 INFO L82 PathProgramCache]: Analyzing trace with hash 779870938, now seen corresponding path program 1 times [2018-12-02 03:17:12,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:12,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:12,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:12,801 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:12,801 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:12,801 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:12,801 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:12,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:12,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:12,802 INFO L87 Difference]: Start difference. First operand 988 states and 1326 transitions. cyclomatic complexity: 339 Second operand 3 states. [2018-12-02 03:17:12,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:12,834 INFO L93 Difference]: Finished difference Result 1925 states and 2547 transitions. [2018-12-02 03:17:12,834 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:12,834 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2547 transitions. [2018-12-02 03:17:12,843 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1900 [2018-12-02 03:17:12,851 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2547 transitions. [2018-12-02 03:17:12,851 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2018-12-02 03:17:12,852 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2018-12-02 03:17:12,853 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2547 transitions. [2018-12-02 03:17:12,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:12,855 INFO L705 BuchiCegarLoop]: Abstraction has 1925 states and 2547 transitions. [2018-12-02 03:17:12,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2547 transitions. [2018-12-02 03:17:12,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1909. [2018-12-02 03:17:12,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2018-12-02 03:17:12,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2527 transitions. [2018-12-02 03:17:12,880 INFO L728 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-12-02 03:17:12,881 INFO L608 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-12-02 03:17:12,881 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-12-02 03:17:12,881 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 2527 transitions. [2018-12-02 03:17:12,887 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1884 [2018-12-02 03:17:12,888 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:12,888 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:12,888 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] [2018-12-02 03:17:12,888 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [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] [2018-12-02 03:17:12,889 INFO L794 eck$LassoCheckResult]: Stem: 15958#ULTIMATE.startENTRY ~max_loop~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; 15814#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 15815#L589 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; 15906#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 15907#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 15816#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 15817#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 15870#L107 assume !(1 == ~P_1_pc~0); 15950#L107-2 is_P_1_triggered_~__retres1~0 := 0; 15951#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 15924#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 15925#L467 assume !(0 != activate_threads_~tmp~1); 15990#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 15788#L175 assume !(1 == ~P_2_pc~0); 15789#L175-2 is_P_2_triggered_~__retres1~1 := 0; 15790#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 15791#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 15835#L475 assume !(0 != activate_threads_~tmp___0~1); 15792#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 15793#L257 assume !(1 == ~C_1_pc~0); 15890#L257-2 assume !(2 == ~C_1_pc~0); 15891#L267-1 is_C_1_triggered_~__retres1~2 := 0; 15955#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 15901#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 15843#L483 assume !(0 != activate_threads_~tmp___1~1); 15844#L537-1 [2018-12-02 03:17:12,889 INFO L796 eck$LassoCheckResult]: Loop: 15844#L537-1 assume !false; 17251#L538 start_simulation_~kernel_st~0 := 1;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; 17248#L386 assume !false; 17246#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17243#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17241#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17238#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17234#L351 assume 0 != eval_~tmp___2~0; 17232#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 17230#L360 assume 0 != eval_~tmp~0;~P_1_st~0 := 1; 15905#L72 assume 0 == ~P_1_pc~0; 15828#L76 assume !(~i~0 < ~max_loop~0); 15829#L95 ~P_1_st~0 := 2; 15859#L356 assume !(0 == ~P_2_st~0); 17387#L371 assume !(0 == ~C_1_st~0); 17408#L386 assume !false; 17402#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17398#L317 assume !(0 == ~P_1_st~0); 17395#L321 assume !(0 == ~P_2_st~0); 17390#L325 assume !(0 == ~C_1_st~0);exists_runnable_thread_~__retres1~3 := 0; 17384#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17383#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 17381#L351 assume !(0 != eval_~tmp___2~0); 17379#L402 start_simulation_~kernel_st~0 := 2; 17378#L287-1 start_simulation_~kernel_st~0 := 3; 17377#L413 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 17376#L107-6 assume !(1 == ~P_1_pc~0); 17372#L107-8 is_P_1_triggered_~__retres1~0 := 0; 17370#L118-2 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 17368#L119-2 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 17365#L467-6 assume 0 != activate_threads_~tmp~1;~P_1_st~0 := 0; 17362#L467-8 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 17360#L175-6 assume !(1 == ~P_2_pc~0); 17358#L175-8 is_P_2_triggered_~__retres1~1 := 0; 17356#L186-2 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 17354#L187-2 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 17352#L475-6 assume !(0 != activate_threads_~tmp___0~1); 17350#L475-8 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 17348#L257-6 assume !(1 == ~C_1_pc~0); 17346#L257-8 assume !(2 == ~C_1_pc~0); 17344#L267-5 is_C_1_triggered_~__retres1~2 := 0; 17343#L278-2 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 17340#L279-2 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 17338#L483-6 assume !(0 != activate_threads_~tmp___1~1); 17336#L483-8 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17333#L317-1 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17331#L334-1 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17329#L335-1 start_simulation_#t~ret9 := exists_runnable_thread_#res;start_simulation_~tmp~3 := start_simulation_#t~ret9;havoc start_simulation_#t~ret9; 17327#L556 assume !(0 == start_simulation_~tmp~3); 17324#L556-1 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;havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 17322#L317-2 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 17321#L334-2 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 17320#L335-2 stop_simulation_#t~ret8 := exists_runnable_thread_#res;stop_simulation_~tmp~2 := stop_simulation_#t~ret8;havoc stop_simulation_#t~ret8; 17318#L511 assume 0 != stop_simulation_~tmp~2;stop_simulation_~__retres2~0 := 0; 17316#L518 stop_simulation_#res := stop_simulation_~__retres2~0; 17314#L519 start_simulation_#t~ret10 := stop_simulation_#res;start_simulation_~tmp___0~2 := start_simulation_#t~ret10;havoc start_simulation_#t~ret10; 17312#L569 assume !(0 != start_simulation_~tmp___0~2); 15844#L537-1 [2018-12-02 03:17:12,889 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:12,900 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-12-02 03:17:12,900 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:12,900 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:12,900 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:12,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:12,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:12,907 INFO L82 PathProgramCache]: Analyzing trace with hash -991600037, now seen corresponding path program 1 times [2018-12-02 03:17:12,907 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:12,907 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:12,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:12,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:12,939 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-02 03:17:12,940 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:12,940 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-02 03:17:12,940 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-12-02 03:17:12,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 03:17:12,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-02 03:17:12,940 INFO L87 Difference]: Start difference. First operand 1909 states and 2527 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-12-02 03:17:12,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:12,989 INFO L93 Difference]: Finished difference Result 3270 states and 4376 transitions. [2018-12-02 03:17:12,990 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 03:17:12,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3270 states and 4376 transitions. [2018-12-02 03:17:12,998 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 3203 [2018-12-02 03:17:13,006 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3270 states to 3270 states and 4376 transitions. [2018-12-02 03:17:13,006 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3270 [2018-12-02 03:17:13,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3270 [2018-12-02 03:17:13,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3270 states and 4376 transitions. [2018-12-02 03:17:13,010 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:13,010 INFO L705 BuchiCegarLoop]: Abstraction has 3270 states and 4376 transitions. [2018-12-02 03:17:13,011 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states and 4376 transitions. [2018-12-02 03:17:13,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 1735. [2018-12-02 03:17:13,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-12-02 03:17:13,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2280 transitions. [2018-12-02 03:17:13,029 INFO L728 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-12-02 03:17:13,029 INFO L608 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-12-02 03:17:13,029 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-12-02 03:17:13,029 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2280 transitions. [2018-12-02 03:17:13,032 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1700 [2018-12-02 03:17:13,032 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:13,032 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:13,033 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] [2018-12-02 03:17:13,033 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:17:13,033 INFO L794 eck$LassoCheckResult]: Stem: 21160#ULTIMATE.startENTRY ~max_loop~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; 21006#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 21007#L589 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; 21101#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 21102#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 21008#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 21009#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 21064#L107 assume !(1 == ~P_1_pc~0); 21151#L107-2 is_P_1_triggered_~__retres1~0 := 0; 21152#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 21120#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 21121#L467 assume !(0 != activate_threads_~tmp~1); 21202#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 20980#L175 assume !(1 == ~P_2_pc~0); 20981#L175-2 is_P_2_triggered_~__retres1~1 := 0; 20982#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 20983#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 21027#L475 assume !(0 != activate_threads_~tmp___0~1); 20984#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 20985#L257 assume !(1 == ~C_1_pc~0); 21083#L257-2 assume !(2 == ~C_1_pc~0); 21084#L267-1 is_C_1_triggered_~__retres1~2 := 0; 21156#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 21096#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 21036#L483 assume !(0 != activate_threads_~tmp___1~1); 21037#L537-1 assume !false; 21472#L538 start_simulation_~kernel_st~0 := 1;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; 21440#L386 [2018-12-02 03:17:13,033 INFO L796 eck$LassoCheckResult]: Loop: 21440#L386 assume !false; 21471#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 21470#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 21465#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 21462#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 21460#L351 assume 0 != eval_~tmp___2~0; 21457#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 21453#L360 assume !(0 != eval_~tmp~0); 21447#L356 assume !(0 == ~P_2_st~0); 21444#L371 assume !(0 == ~C_1_st~0); 21440#L386 [2018-12-02 03:17:13,033 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,033 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-12-02 03:17:13,033 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,033 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,033 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,034 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,034 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,086 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,086 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-12-02 03:17:13,086 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,087 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,087 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,091 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,091 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-12-02 03:17:13,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,091 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,092 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,092 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:13,102 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:13,102 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:13,102 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:13,129 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:13,129 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:13,129 INFO L87 Difference]: Start difference. First operand 1735 states and 2280 transitions. cyclomatic complexity: 548 Second operand 3 states. [2018-12-02 03:17:13,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:13,158 INFO L93 Difference]: Finished difference Result 2774 states and 3602 transitions. [2018-12-02 03:17:13,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:13,159 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2774 states and 3602 transitions. [2018-12-02 03:17:13,168 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2709 [2018-12-02 03:17:13,179 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2774 states to 2774 states and 3602 transitions. [2018-12-02 03:17:13,179 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2774 [2018-12-02 03:17:13,181 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2774 [2018-12-02 03:17:13,181 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2774 states and 3602 transitions. [2018-12-02 03:17:13,183 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:13,184 INFO L705 BuchiCegarLoop]: Abstraction has 2774 states and 3602 transitions. [2018-12-02 03:17:13,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states and 3602 transitions. [2018-12-02 03:17:13,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2682. [2018-12-02 03:17:13,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-12-02 03:17:13,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3490 transitions. [2018-12-02 03:17:13,216 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-12-02 03:17:13,216 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-12-02 03:17:13,216 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-12-02 03:17:13,217 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3490 transitions. [2018-12-02 03:17:13,223 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-12-02 03:17:13,223 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:13,223 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:13,224 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] [2018-12-02 03:17:13,224 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:17:13,224 INFO L794 eck$LassoCheckResult]: Stem: 25680#ULTIMATE.startENTRY ~max_loop~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; 25520#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 25521#L589 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; 25624#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 25625#L294-1 assume !(1 == ~P_2_i~0);~P_2_st~0 := 2; 25689#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 25581#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 25582#L107 assume !(1 == ~P_1_pc~0); 25672#L107-2 is_P_1_triggered_~__retres1~0 := 0; 25673#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 25640#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 25641#L467 assume !(0 != activate_threads_~tmp~1); 25719#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 25720#L175 assume !(1 == ~P_2_pc~0); 27487#L175-2 is_P_2_triggered_~__retres1~1 := 0; 27486#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 27485#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 25541#L475 assume !(0 != activate_threads_~tmp___0~1); 25542#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 25612#L257 assume !(1 == ~C_1_pc~0); 25613#L257-2 assume !(2 == ~C_1_pc~0); 27454#L267-1 is_C_1_triggered_~__retres1~2 := 0; 27452#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 27450#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 27448#L483 assume !(0 != activate_threads_~tmp___1~1); 27446#L537-1 assume !false; 27437#L538 start_simulation_~kernel_st~0 := 1;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; 27432#L386 [2018-12-02 03:17:13,224 INFO L796 eck$LassoCheckResult]: Loop: 27432#L386 assume !false; 27430#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 27428#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 27426#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 27424#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 27422#L351 assume 0 != eval_~tmp___2~0; 27420#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 27417#L360 assume !(0 != eval_~tmp~0); 27418#L356 assume !(0 == ~P_2_st~0); 27435#L371 assume !(0 == ~C_1_st~0); 27432#L386 [2018-12-02 03:17:13,224 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,224 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-12-02 03:17:13,224 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,224 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,225 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,225 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:13,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:13,235 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:13,236 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-02 03:17:13,236 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-12-02 03:17:13,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,236 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-12-02 03:17:13,236 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,236 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,237 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,237 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,280 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:13,280 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:13,280 INFO L87 Difference]: Start difference. First operand 2682 states and 3490 transitions. cyclomatic complexity: 811 Second operand 3 states. [2018-12-02 03:17:13,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:13,288 INFO L93 Difference]: Finished difference Result 2660 states and 3467 transitions. [2018-12-02 03:17:13,288 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:13,288 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 3467 transitions. [2018-12-02 03:17:13,296 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-12-02 03:17:13,306 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-12-02 03:17:13,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2660 [2018-12-02 03:17:13,307 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2660 [2018-12-02 03:17:13,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2660 states and 3467 transitions. [2018-12-02 03:17:13,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:13,310 INFO L705 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-12-02 03:17:13,311 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states and 3467 transitions. [2018-12-02 03:17:13,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2660. [2018-12-02 03:17:13,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-12-02 03:17:13,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-12-02 03:17:13,339 INFO L728 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-12-02 03:17:13,339 INFO L608 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-12-02 03:17:13,339 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-12-02 03:17:13,339 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2660 states and 3467 transitions. [2018-12-02 03:17:13,345 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-12-02 03:17:13,345 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:13,345 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:13,346 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] [2018-12-02 03:17:13,346 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:17:13,346 INFO L794 eck$LassoCheckResult]: Stem: 31021#ULTIMATE.startENTRY ~max_loop~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; 30868#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 30869#L589 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; 30966#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 30967#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 30874#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 30875#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 30926#L107 assume !(1 == ~P_1_pc~0); 31012#L107-2 is_P_1_triggered_~__retres1~0 := 0; 31013#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 30982#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 30983#L467 assume !(0 != activate_threads_~tmp~1); 31054#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 30845#L175 assume !(1 == ~P_2_pc~0); 30846#L175-2 is_P_2_triggered_~__retres1~1 := 0; 30847#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 30848#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 30892#L475 assume !(0 != activate_threads_~tmp___0~1); 30849#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 30850#L257 assume !(1 == ~C_1_pc~0); 30945#L257-2 assume !(2 == ~C_1_pc~0); 30946#L267-1 is_C_1_triggered_~__retres1~2 := 0; 31016#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 30957#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 30897#L483 assume !(0 != activate_threads_~tmp___1~1); 30898#L537-1 assume !false; 30924#L538 start_simulation_~kernel_st~0 := 1;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; 30925#L386 [2018-12-02 03:17:13,346 INFO L796 eck$LassoCheckResult]: Loop: 30925#L386 assume !false; 30959#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 30979#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 30928#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 30929#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 30912#L351 assume 0 != eval_~tmp___2~0; 30876#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 30877#L360 assume !(0 != eval_~tmp~0); 31033#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 32102#L375 assume !(0 != eval_~tmp___0~0); 32103#L371 assume !(0 == ~C_1_st~0); 30925#L386 [2018-12-02 03:17:13,346 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,346 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-12-02 03:17:13,346 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,346 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,347 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:13,347 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,353 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,353 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-12-02 03:17:13,353 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,354 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,354 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:13,354 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,357 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,357 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-12-02 03:17:13,357 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,357 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,358 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,358 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 03:17:13,368 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 03:17:13,368 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 03:17:13,369 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 03:17:13,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 03:17:13,424 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 03:17:13,424 INFO L87 Difference]: Start difference. First operand 2660 states and 3467 transitions. cyclomatic complexity: 810 Second operand 3 states. [2018-12-02 03:17:13,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 03:17:13,448 INFO L93 Difference]: Finished difference Result 4373 states and 5643 transitions. [2018-12-02 03:17:13,448 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 03:17:13,448 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 5643 transitions. [2018-12-02 03:17:13,456 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-12-02 03:17:13,464 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-12-02 03:17:13,464 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2018-12-02 03:17:13,466 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2018-12-02 03:17:13,466 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4373 states and 5643 transitions. [2018-12-02 03:17:13,468 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-12-02 03:17:13,469 INFO L705 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-12-02 03:17:13,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states and 5643 transitions. [2018-12-02 03:17:13,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2018-12-02 03:17:13,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2018-12-02 03:17:13,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-12-02 03:17:13,497 INFO L728 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-12-02 03:17:13,497 INFO L608 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-12-02 03:17:13,497 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-12-02 03:17:13,497 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4373 states and 5643 transitions. [2018-12-02 03:17:13,504 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-12-02 03:17:13,505 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-12-02 03:17:13,505 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-12-02 03:17:13,505 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] [2018-12-02 03:17:13,505 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 03:17:13,505 INFO L794 eck$LassoCheckResult]: Stem: 38077#ULTIMATE.startENTRY ~max_loop~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; 37909#L-1 havoc main_#res;havoc main_~count~0, main_~__retres2~1;havoc main_~count~0;havoc main_~__retres2~1;~num~0 := 0;~i~0 := 0;~max_loop~0 := 2;~timer~0 := 0;~P_1_pc~0 := 0;~P_2_pc~0 := 0;~C_1_pc~0 := 0;main_~count~0 := 0;~P_1_i~0 := 1;~P_2_i~0 := 1;~C_1_i~0 := 1; 37910#L589 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; 38009#L287 assume 1 == ~P_1_i~0;~P_1_st~0 := 0; 38010#L294-1 assume 1 == ~P_2_i~0;~P_2_st~0 := 0; 37911#L299-1 assume 1 == ~C_1_i~0;~C_1_st~0 := 0; 37912#L304-1 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;havoc is_P_1_triggered_#res;havoc is_P_1_triggered_~__retres1~0;havoc is_P_1_triggered_~__retres1~0; 37968#L107 assume !(1 == ~P_1_pc~0); 38067#L107-2 is_P_1_triggered_~__retres1~0 := 0; 38068#L118 is_P_1_triggered_#res := is_P_1_triggered_~__retres1~0; 38029#L119 activate_threads_#t~ret5 := is_P_1_triggered_#res;activate_threads_~tmp~1 := activate_threads_#t~ret5;havoc activate_threads_#t~ret5; 38030#L467 assume !(0 != activate_threads_~tmp~1); 38116#L467-2 havoc is_P_2_triggered_#res;havoc is_P_2_triggered_~__retres1~1;havoc is_P_2_triggered_~__retres1~1; 37886#L175 assume !(1 == ~P_2_pc~0); 37887#L175-2 is_P_2_triggered_~__retres1~1 := 0; 37888#L186 is_P_2_triggered_#res := is_P_2_triggered_~__retres1~1; 37889#L187 activate_threads_#t~ret6 := is_P_2_triggered_#res;activate_threads_~tmp___0~1 := activate_threads_#t~ret6;havoc activate_threads_#t~ret6; 37931#L475 assume !(0 != activate_threads_~tmp___0~1); 37890#L475-2 havoc is_C_1_triggered_#res;havoc is_C_1_triggered_~__retres1~2;havoc is_C_1_triggered_~__retres1~2; 37891#L257 assume !(1 == ~C_1_pc~0); 37987#L257-2 assume !(2 == ~C_1_pc~0); 37988#L267-1 is_C_1_triggered_~__retres1~2 := 0; 38074#L278 is_C_1_triggered_#res := is_C_1_triggered_~__retres1~2; 38001#L279 activate_threads_#t~ret7 := is_C_1_triggered_#res;activate_threads_~tmp___1~1 := activate_threads_#t~ret7;havoc activate_threads_#t~ret7; 37939#L483 assume !(0 != activate_threads_~tmp___1~1); 37940#L537-1 assume !false; 39076#L538 start_simulation_~kernel_st~0 := 1;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; 38562#L386 [2018-12-02 03:17:13,505 INFO L796 eck$LassoCheckResult]: Loop: 38562#L386 assume !false; 39073#L347 havoc exists_runnable_thread_#res;havoc exists_runnable_thread_~__retres1~3;havoc exists_runnable_thread_~__retres1~3; 39071#L317 assume 0 == ~P_1_st~0;exists_runnable_thread_~__retres1~3 := 1; 39069#L334 exists_runnable_thread_#res := exists_runnable_thread_~__retres1~3; 39067#L335 eval_#t~ret1 := exists_runnable_thread_#res;eval_~tmp___2~0 := eval_#t~ret1;havoc eval_#t~ret1; 39065#L351 assume 0 != eval_~tmp___2~0; 39064#L351-1 assume 0 == ~P_1_st~0;eval_~tmp~0 := eval_#t~nondet2;havoc eval_#t~nondet2; 39062#L360 assume !(0 != eval_~tmp~0); 38569#L356 assume 0 == ~P_2_st~0;eval_~tmp___0~0 := eval_#t~nondet3;havoc eval_#t~nondet3; 38566#L375 assume !(0 != eval_~tmp___0~0); 38564#L371 assume 0 == ~C_1_st~0;eval_~tmp___1~0 := eval_#t~nondet4;havoc eval_#t~nondet4; 38547#L390 assume !(0 != eval_~tmp___1~0); 38562#L386 [2018-12-02 03:17:13,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,505 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-12-02 03:17:13,505 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,505 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,510 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,510 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-12-02 03:17:13,510 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,510 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,510 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,510 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 03:17:13,511 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,513 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 03:17:13,513 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-12-02 03:17:13,513 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-12-02 03:17:13,513 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-12-02 03:17:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,513 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 03:17:13,513 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 03:17:13,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-12-02 03:17:13,742 WARN L180 SmtUtils]: Spent 175.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-12-02 03:17:13,796 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 02.12 03:17:13 BoogieIcfgContainer [2018-12-02 03:17:13,796 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-12-02 03:17:13,797 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 03:17:13,797 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 03:17:13,797 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 03:17:13,797 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 03:17:08" (3/4) ... [2018-12-02 03:17:13,799 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-12-02 03:17:13,835 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_1b950e5a-84e5-478c-8d62-692e633ecc73/bin-2019/uautomizer/witness.graphml [2018-12-02 03:17:13,836 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 03:17:13,836 INFO L168 Benchmark]: Toolchain (without parser) took 5532.26 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 287.8 MB). Free memory was 954.4 MB in the beginning and 1.0 GB in the end (delta: -51.5 MB). Peak memory consumption was 236.3 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: CACSL2BoogieTranslator took 168.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 938.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: Boogie Procedure Inliner took 62.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: Boogie Preprocessor took 19.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: RCFGBuilder took 334.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: BuchiAutomizer took 4905.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. [2018-12-02 03:17:13,837 INFO L168 Benchmark]: Witness Printer took 38.98 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-12-02 03:17:13,839 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 168.90 ms. Allocated memory is still 1.0 GB. Free memory was 954.4 MB in the beginning and 938.3 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 62.26 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 100.7 MB). Free memory was 938.3 MB in the beginning and 1.1 GB in the end (delta: -160.2 MB). Peak memory consumption was 13.2 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 19.39 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 334.42 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 44.2 MB). Peak memory consumption was 44.2 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 4905.77 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 187.2 MB). Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 45.8 MB). Peak memory consumption was 232.9 MB. Max. memory is 11.5 GB. * Witness Printer took 38.98 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 4373 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 4.8s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 3.7s. Construction of modules took 0.2s. Büchi inclusion checks took 0.2s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 14 MinimizatonAttempts, 4182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 4373 states and ocurred in iteration 14. Nontrivial modules had stage [0, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 3501 SDtfs, 4366 SDslu, 4736 SDs, 0 SdLazy, 305 SolverSat, 121 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time LassoAnalysisResults: nont1 unkn0 SFLI6 SFLT0 conc3 concLT0 SILN1 SILU0 SILI4 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: 4ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 346]: 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@6825baa0=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@25cdb569=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@46cd6f62=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@5455fbc=0, tmp___2=1, tmp___0=0, \result=0, i=0, P_1_i=1, e=0, P_2_pc=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@20857064=0, tmp___0=0, __retres1=0, tmp___1=0, data_1=0, __retres1=1, \result=0, max_loop=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e640cb9=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@13a2eceb=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@f85731a=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@7a7babb8=0, C_1_ev=0, tmp___1=0, timer=0, __retres2=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 346]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L15] int max_loop ; [L16] int num ; [L17] int i ; [L18] int e ; [L19] int timer ; [L20] char data_0 ; [L21] char data_1 ; [L64] int P_1_pc; [L65] int P_1_st ; [L66] int P_1_i ; [L67] int P_1_ev ; [L122] int P_2_pc ; [L123] int P_2_st ; [L124] int P_2_i ; [L125] int P_2_ev ; [L190] int C_1_pc ; [L191] int C_1_st ; [L192] int C_1_i ; [L193] int C_1_ev ; [L194] int C_1_pr ; [L593] int count ; [L594] int __retres2 ; [L598] num = 0 [L599] i = 0 [L600] max_loop = 2 [L602] timer = 0 [L603] P_1_pc = 0 [L604] P_2_pc = 0 [L605] C_1_pc = 0 [L607] count = 0 [L585] P_1_i = 1 [L586] P_2_i = 1 [L587] C_1_i = 1 [L523] int kernel_st ; [L524] int tmp ; [L525] int tmp___0 ; [L529] kernel_st = 0 [L294] COND TRUE (int )P_1_i == 1 [L295] P_1_st = 0 [L299] COND TRUE (int )P_2_i == 1 [L300] P_2_st = 0 [L304] COND TRUE (int )C_1_i == 1 [L305] C_1_st = 0 [L459] int tmp ; [L460] int tmp___0 ; [L461] int tmp___1 ; [L104] int __retres1 ; [L107] COND FALSE !((int )P_1_pc == 1) [L117] __retres1 = 0 [L119] return (__retres1); [L465] tmp = is_P_1_triggered() [L467] COND FALSE !(\read(tmp)) [L172] int __retres1 ; [L175] COND FALSE !((int )P_2_pc == 1) [L185] __retres1 = 0 [L187] return (__retres1); [L473] tmp___0 = is_P_2_triggered() [L475] COND FALSE !(\read(tmp___0)) [L254] int __retres1 ; [L257] COND FALSE !((int )C_1_pc == 1) [L267] COND FALSE !((int )C_1_pc == 2) [L277] __retres1 = 0 [L279] return (__retres1); [L481] tmp___1 = is_C_1_triggered() [L483] COND FALSE !(\read(tmp___1)) [L537] COND TRUE 1 [L540] kernel_st = 1 [L339] int tmp ; [L340] int tmp___0 ; [L341] int tmp___1 ; [L342] int tmp___2 ; Loop: [L346] COND TRUE 1 [L314] int __retres1 ; [L317] COND TRUE (int )P_1_st == 0 [L318] __retres1 = 1 [L335] return (__retres1); [L349] tmp___2 = exists_runnable_thread() [L351] COND TRUE \read(tmp___2) [L356] COND TRUE (int )P_1_st == 0 [L358] tmp = __VERIFIER_nondet_int() [L360] COND FALSE !(\read(tmp)) [L371] COND TRUE (int )P_2_st == 0 [L373] tmp___0 = __VERIFIER_nondet_int() [L375] COND FALSE !(\read(tmp___0)) [L386] COND TRUE (int )C_1_st == 0 [L388] tmp___1 = __VERIFIER_nondet_int() [L390] COND FALSE !(\read(tmp___1)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! Received shutdown request...