./Ultimate.py --spec /storage/repos/svcomp/c/properties/termination.prp --file /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 91b1670e Calling Ultimate with: java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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.24-91b1670 [2018-11-29 00:04:42,771 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-29 00:04:42,772 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-29 00:04:42,785 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-29 00:04:42,785 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-29 00:04:42,786 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-29 00:04:42,788 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-29 00:04:42,790 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-29 00:04:42,792 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-29 00:04:42,793 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-29 00:04:42,794 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-29 00:04:42,794 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-29 00:04:42,796 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-29 00:04:42,797 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-29 00:04:42,798 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-29 00:04:42,799 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-29 00:04:42,800 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-29 00:04:42,802 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-29 00:04:42,805 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-29 00:04:42,806 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-29 00:04:42,808 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-29 00:04:42,811 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-29 00:04:42,816 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-29 00:04:42,818 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-29 00:04:42,818 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-29 00:04:42,819 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-29 00:04:42,820 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-29 00:04:42,821 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-29 00:04:42,822 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-29 00:04:42,824 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-29 00:04:42,824 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-29 00:04:42,825 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-29 00:04:42,825 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-29 00:04:42,825 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-29 00:04:42,826 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-29 00:04:42,828 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-29 00:04:42,828 INFO L98 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2018-11-29 00:04:42,845 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-29 00:04:42,845 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-29 00:04:42,846 INFO L131 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2018-11-29 00:04:42,846 INFO L133 SettingsManager]: * Create parallel compositions if possible=false [2018-11-29 00:04:42,847 INFO L133 SettingsManager]: * Use SBE=true [2018-11-29 00:04:42,847 INFO L131 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2018-11-29 00:04:42,847 INFO L133 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2018-11-29 00:04:42,847 INFO L133 SettingsManager]: * Use old map elimination=false [2018-11-29 00:04:42,847 INFO L133 SettingsManager]: * Use external solver (rank synthesis)=false [2018-11-29 00:04:42,847 INFO L133 SettingsManager]: * Use only trivial implications for array writes=true [2018-11-29 00:04:42,849 INFO L133 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2018-11-29 00:04:42,849 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-29 00:04:42,849 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-29 00:04:42,849 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-29 00:04:42,849 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-29 00:04:42,850 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-29 00:04:42,850 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-29 00:04:42,851 INFO L133 SettingsManager]: * Assume nondeterminstic values are in range=false [2018-11-29 00:04:42,852 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-29 00:04:42,852 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2018-11-29 00:04:42,853 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-29 00:04:42,853 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-29 00:04:42,853 INFO L133 SettingsManager]: * To the following directory=/home/matthias/ultimate/dump [2018-11-29 00:04:42,853 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-29 00:04:42,853 INFO L133 SettingsManager]: * Trace refinement strategy=CAMEL [2018-11-29 00:04:42,854 INFO L133 SettingsManager]: * Dump automata to the following directory=/home/matthias/ultimate/dump/auto [2018-11-29 00:04:42,854 INFO L131 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2018-11-29 00:04:42,856 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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-11-29 00:04:42,902 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-29 00:04:42,921 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-29 00:04:42,928 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-29 00:04:42,930 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-29 00:04:42,931 INFO L276 PluginConnector]: CDTParser initialized [2018-11-29 00:04:42,932 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:42,997 INFO L221 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7d72330/cc661da8ba2f41cca12ea7aa00117ffd/FLAG2a6aa70f1 [2018-11-29 00:04:43,487 INFO L307 CDTParser]: Found 1 translation units. [2018-11-29 00:04:43,487 INFO L161 CDTParser]: Scanning /storage/repos/svcomp/c/systemc/kundu2_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:43,505 INFO L355 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7d72330/cc661da8ba2f41cca12ea7aa00117ffd/FLAG2a6aa70f1 [2018-11-29 00:04:43,786 INFO L363 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0f7d72330/cc661da8ba2f41cca12ea7aa00117ffd [2018-11-29 00:04:43,790 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-29 00:04:43,792 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-29 00:04:43,793 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:43,793 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-29 00:04:43,798 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-29 00:04:43,799 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:43" (1/1) ... [2018-11-29 00:04:43,803 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1465e9e6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:43, skipping insertion in model container [2018-11-29 00:04:43,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 12:04:43" (1/1) ... [2018-11-29 00:04:43,811 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-29 00:04:43,866 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-29 00:04:44,183 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:44,193 INFO L191 MainTranslator]: Completed pre-run [2018-11-29 00:04:44,288 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-11-29 00:04:44,315 INFO L195 MainTranslator]: Completed translation [2018-11-29 00:04:44,315 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44 WrapperNode [2018-11-29 00:04:44,315 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-29 00:04:44,316 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:44,316 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-29 00:04:44,316 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-29 00:04:44,324 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,332 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,375 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-29 00:04:44,375 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-29 00:04:44,376 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-29 00:04:44,376 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-29 00:04:44,386 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,386 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,390 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,390 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,401 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,503 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,511 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... [2018-11-29 00:04:44,517 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-29 00:04:44,517 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-29 00:04:44,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-29 00:04:44,518 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-29 00:04:44,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:44,597 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-29 00:04:44,598 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-29 00:04:45,917 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-29 00:04:45,918 INFO L280 CfgBuilder]: Removed 95 assue(true) statements. [2018-11-29 00:04:45,919 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:45 BoogieIcfgContainer [2018-11-29 00:04:45,919 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-29 00:04:45,919 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2018-11-29 00:04:45,920 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2018-11-29 00:04:45,925 INFO L276 PluginConnector]: BuchiAutomizer initialized [2018-11-29 00:04:45,926 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:45,926 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 29.11 12:04:43" (1/3) ... [2018-11-29 00:04:45,927 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32359a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:45, skipping insertion in model container [2018-11-29 00:04:45,927 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:45,927 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 12:04:44" (2/3) ... [2018-11-29 00:04:45,928 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@32359a54 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 29.11 12:04:45, skipping insertion in model container [2018-11-29 00:04:45,928 INFO L102 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2018-11-29 00:04:45,928 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:45" (3/3) ... [2018-11-29 00:04:45,931 INFO L375 chiAutomizerObserver]: Analyzing ICFG kundu2_false-unreach-call_false-termination.cil.c [2018-11-29 00:04:45,989 INFO L133 ementStrategyFactory]: Using default assertion order modulation [2018-11-29 00:04:45,990 INFO L374 BuchiCegarLoop]: Interprodecural is true [2018-11-29 00:04:45,990 INFO L375 BuchiCegarLoop]: Hoare is false [2018-11-29 00:04:45,990 INFO L376 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2018-11-29 00:04:45,990 INFO L377 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-29 00:04:45,990 INFO L378 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-29 00:04:45,991 INFO L379 BuchiCegarLoop]: Difference is false [2018-11-29 00:04:45,991 INFO L380 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-29 00:04:45,991 INFO L383 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2018-11-29 00:04:46,012 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-11-29 00:04:46,046 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-11-29 00:04:46,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,048 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,058 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-11-29 00:04:46,059 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-11-29 00:04:46,059 INFO L442 BuchiCegarLoop]: ======== Iteration 1============ [2018-11-29 00:04:46,059 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 176 states. [2018-11-29 00:04:46,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 143 [2018-11-29 00:04:46,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,072 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-11-29 00:04:46,072 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-11-29 00:04:46,081 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-11-29 00:04:46,081 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-11-29 00:04:46,089 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,089 INFO L82 PathProgramCache]: Analyzing trace with hash -1148319283, now seen corresponding path program 1 times [2018-11-29 00:04:46,091 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,092 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,148 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,148 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,256 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,257 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:46,263 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:46,264 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2040352856, now seen corresponding path program 1 times [2018-11-29 00:04:46,264 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,264 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,266 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,266 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,279 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,280 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,280 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:04:46,282 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:46,301 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:46,302 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:46,304 INFO L87 Difference]: Start difference. First operand 176 states. Second operand 3 states. [2018-11-29 00:04:46,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:46,353 INFO L93 Difference]: Finished difference Result 175 states and 257 transitions. [2018-11-29 00:04:46,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:46,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 175 states and 257 transitions. [2018-11-29 00:04:46,364 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-29 00:04:46,372 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 175 states to 167 states and 249 transitions. [2018-11-29 00:04:46,373 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-29 00:04:46,375 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-29 00:04:46,376 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 249 transitions. [2018-11-29 00:04:46,377 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:46,377 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-29 00:04:46,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 249 transitions. [2018-11-29 00:04:46,428 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-29 00:04:46,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-29 00:04:46,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 249 transitions. [2018-11-29 00:04:46,432 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-29 00:04:46,432 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 249 transitions. [2018-11-29 00:04:46,432 INFO L442 BuchiCegarLoop]: ======== Iteration 2============ [2018-11-29 00:04:46,432 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 249 transitions. [2018-11-29 00:04:46,436 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-29 00:04:46,436 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,436 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,438 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-11-29 00:04:46,438 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-11-29 00:04:46,438 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-11-29 00:04:46,439 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-11-29 00:04:46,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,439 INFO L82 PathProgramCache]: Analyzing trace with hash -1571021109, now seen corresponding path program 1 times [2018-11-29 00:04:46,439 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,440 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,484 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:46,485 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:46,486 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,486 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 1 times [2018-11-29 00:04:46,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,487 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,488 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,488 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,612 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,612 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:46,613 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:46,613 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:46,613 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:46,615 INFO L87 Difference]: Start difference. First operand 167 states and 249 transitions. cyclomatic complexity: 83 Second operand 3 states. [2018-11-29 00:04:46,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:46,667 INFO L93 Difference]: Finished difference Result 167 states and 248 transitions. [2018-11-29 00:04:46,670 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:46,671 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 167 states and 248 transitions. [2018-11-29 00:04:46,676 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-29 00:04:46,680 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 167 states to 167 states and 248 transitions. [2018-11-29 00:04:46,680 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 167 [2018-11-29 00:04:46,681 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 167 [2018-11-29 00:04:46,682 INFO L73 IsDeterministic]: Start isDeterministic. Operand 167 states and 248 transitions. [2018-11-29 00:04:46,683 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:46,684 INFO L705 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-29 00:04:46,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states and 248 transitions. [2018-11-29 00:04:46,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2018-11-29 00:04:46,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 167 states. [2018-11-29 00:04:46,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 248 transitions. [2018-11-29 00:04:46,695 INFO L728 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-29 00:04:46,695 INFO L608 BuchiCegarLoop]: Abstraction has 167 states and 248 transitions. [2018-11-29 00:04:46,695 INFO L442 BuchiCegarLoop]: ======== Iteration 3============ [2018-11-29 00:04:46,696 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 167 states and 248 transitions. [2018-11-29 00:04:46,698 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 138 [2018-11-29 00:04:46,698 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:46,699 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:46,701 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-11-29 00:04:46,701 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-11-29 00:04:46,702 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-11-29 00:04:46,702 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-11-29 00:04:46,702 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,703 INFO L82 PathProgramCache]: Analyzing trace with hash 117922633, now seen corresponding path program 1 times [2018-11-29 00:04:46,703 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,703 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,709 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,774 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,774 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,775 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:46,775 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:46,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:46,776 INFO L82 PathProgramCache]: Analyzing trace with hash 2072132131, now seen corresponding path program 2 times [2018-11-29 00:04:46,776 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:46,776 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:46,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,777 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:46,778 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:46,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:46,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:46,882 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:46,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:46,882 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:46,883 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:46,883 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:46,883 INFO L87 Difference]: Start difference. First operand 167 states and 248 transitions. cyclomatic complexity: 82 Second operand 3 states. [2018-11-29 00:04:47,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:47,030 INFO L93 Difference]: Finished difference Result 301 states and 442 transitions. [2018-11-29 00:04:47,031 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:47,031 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 301 states and 442 transitions. [2018-11-29 00:04:47,036 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 273 [2018-11-29 00:04:47,043 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 301 states to 301 states and 442 transitions. [2018-11-29 00:04:47,045 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 301 [2018-11-29 00:04:47,047 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 301 [2018-11-29 00:04:47,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 301 states and 442 transitions. [2018-11-29 00:04:47,057 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:47,057 INFO L705 BuchiCegarLoop]: Abstraction has 301 states and 442 transitions. [2018-11-29 00:04:47,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 301 states and 442 transitions. [2018-11-29 00:04:47,078 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 301 to 286. [2018-11-29 00:04:47,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 286 states. [2018-11-29 00:04:47,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 286 states to 286 states and 421 transitions. [2018-11-29 00:04:47,080 INFO L728 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-11-29 00:04:47,081 INFO L608 BuchiCegarLoop]: Abstraction has 286 states and 421 transitions. [2018-11-29 00:04:47,081 INFO L442 BuchiCegarLoop]: ======== Iteration 4============ [2018-11-29 00:04:47,081 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 286 states and 421 transitions. [2018-11-29 00:04:47,084 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 258 [2018-11-29 00:04:47,085 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:47,085 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:47,086 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-11-29 00:04:47,086 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-11-29 00:04:47,088 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-11-29 00:04:47,088 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-11-29 00:04:47,088 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,089 INFO L82 PathProgramCache]: Analyzing trace with hash -754916022, now seen corresponding path program 1 times [2018-11-29 00:04:47,089 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,089 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,094 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,095 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:47,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:47,150 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:04:47,151 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,151 INFO L82 PathProgramCache]: Analyzing trace with hash 481737154, now seen corresponding path program 1 times [2018-11-29 00:04:47,151 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,151 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,152 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,152 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,153 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,227 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,227 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:47,227 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:47,228 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:47,228 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:47,228 INFO L87 Difference]: Start difference. First operand 286 states and 421 transitions. cyclomatic complexity: 136 Second operand 3 states. [2018-11-29 00:04:47,675 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:47,677 INFO L93 Difference]: Finished difference Result 532 states and 764 transitions. [2018-11-29 00:04:47,678 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:47,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 532 states and 764 transitions. [2018-11-29 00:04:47,684 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 506 [2018-11-29 00:04:47,692 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 532 states to 532 states and 764 transitions. [2018-11-29 00:04:47,692 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 532 [2018-11-29 00:04:47,693 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 532 [2018-11-29 00:04:47,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 532 states and 764 transitions. [2018-11-29 00:04:47,700 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:47,701 INFO L705 BuchiCegarLoop]: Abstraction has 532 states and 764 transitions. [2018-11-29 00:04:47,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 532 states and 764 transitions. [2018-11-29 00:04:47,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 532 to 516. [2018-11-29 00:04:47,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 516 states. [2018-11-29 00:04:47,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 516 states to 516 states and 744 transitions. [2018-11-29 00:04:47,734 INFO L728 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-11-29 00:04:47,735 INFO L608 BuchiCegarLoop]: Abstraction has 516 states and 744 transitions. [2018-11-29 00:04:47,735 INFO L442 BuchiCegarLoop]: ======== Iteration 5============ [2018-11-29 00:04:47,736 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 516 states and 744 transitions. [2018-11-29 00:04:47,740 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 490 [2018-11-29 00:04:47,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:47,741 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:47,742 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-11-29 00:04:47,743 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-11-29 00:04:47,743 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-11-29 00:04:47,743 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-11-29 00:04:47,747 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 1 times [2018-11-29 00:04:47,748 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,748 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,749 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,759 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:47,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:47,807 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:47,809 INFO L82 PathProgramCache]: Analyzing trace with hash 290270835, now seen corresponding path program 1 times [2018-11-29 00:04:47,809 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:47,809 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:47,810 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,818 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:47,818 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:47,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:47,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:47,919 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:47,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:47,919 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:47,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:47,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:47,920 INFO L87 Difference]: Start difference. First operand 516 states and 744 transitions. cyclomatic complexity: 229 Second operand 5 states. [2018-11-29 00:04:48,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:48,569 INFO L93 Difference]: Finished difference Result 908 states and 1298 transitions. [2018-11-29 00:04:48,570 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-29 00:04:48,570 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 908 states and 1298 transitions. [2018-11-29 00:04:48,580 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 882 [2018-11-29 00:04:48,589 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 908 states to 908 states and 1298 transitions. [2018-11-29 00:04:48,589 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 908 [2018-11-29 00:04:48,590 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 908 [2018-11-29 00:04:48,590 INFO L73 IsDeterministic]: Start isDeterministic. Operand 908 states and 1298 transitions. [2018-11-29 00:04:48,594 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:48,594 INFO L705 BuchiCegarLoop]: Abstraction has 908 states and 1298 transitions. [2018-11-29 00:04:48,595 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 908 states and 1298 transitions. [2018-11-29 00:04:48,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 908 to 528. [2018-11-29 00:04:48,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 528 states. [2018-11-29 00:04:48,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 756 transitions. [2018-11-29 00:04:48,617 INFO L728 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-11-29 00:04:48,617 INFO L608 BuchiCegarLoop]: Abstraction has 528 states and 756 transitions. [2018-11-29 00:04:48,617 INFO L442 BuchiCegarLoop]: ======== Iteration 6============ [2018-11-29 00:04:48,617 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 528 states and 756 transitions. [2018-11-29 00:04:48,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 502 [2018-11-29 00:04:48,623 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:48,624 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:48,625 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-11-29 00:04:48,630 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:48,630 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-11-29 00:04:48,631 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-11-29 00:04:48,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:48,631 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 2 times [2018-11-29 00:04:48,631 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:48,632 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:48,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,640 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:48,640 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:48,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:48,682 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:48,683 INFO L82 PathProgramCache]: Analyzing trace with hash -303364692, now seen corresponding path program 1 times [2018-11-29 00:04:48,683 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:48,683 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:48,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:48,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:48,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:48,769 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:48,771 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:48,771 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:48,771 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:48,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:48,773 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:48,773 INFO L87 Difference]: Start difference. First operand 528 states and 756 transitions. cyclomatic complexity: 229 Second operand 3 states. [2018-11-29 00:04:48,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:48,991 INFO L93 Difference]: Finished difference Result 922 states and 1296 transitions. [2018-11-29 00:04:48,994 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:48,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 922 states and 1296 transitions. [2018-11-29 00:04:49,003 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-11-29 00:04:49,010 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 922 states to 922 states and 1296 transitions. [2018-11-29 00:04:49,010 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 922 [2018-11-29 00:04:49,012 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 922 [2018-11-29 00:04:49,012 INFO L73 IsDeterministic]: Start isDeterministic. Operand 922 states and 1296 transitions. [2018-11-29 00:04:49,015 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:49,015 INFO L705 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-29 00:04:49,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 922 states and 1296 transitions. [2018-11-29 00:04:49,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 922 to 922. [2018-11-29 00:04:49,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 922 states. [2018-11-29 00:04:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 922 states to 922 states and 1296 transitions. [2018-11-29 00:04:49,036 INFO L728 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-29 00:04:49,036 INFO L608 BuchiCegarLoop]: Abstraction has 922 states and 1296 transitions. [2018-11-29 00:04:49,036 INFO L442 BuchiCegarLoop]: ======== Iteration 7============ [2018-11-29 00:04:49,036 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 922 states and 1296 transitions. [2018-11-29 00:04:49,043 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 896 [2018-11-29 00:04:49,043 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:49,043 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:49,044 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-11-29 00:04:49,045 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:49,046 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-11-29 00:04:49,046 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-11-29 00:04:49,047 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,047 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 3 times [2018-11-29 00:04:49,047 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,047 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,053 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,053 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:49,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,061 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,087 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,087 INFO L82 PathProgramCache]: Analyzing trace with hash 2068374570, now seen corresponding path program 1 times [2018-11-29 00:04:49,087 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,087 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,088 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:49,088 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:49,220 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:49,220 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:49,221 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:49,221 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:49,221 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:49,221 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:49,222 INFO L87 Difference]: Start difference. First operand 922 states and 1296 transitions. cyclomatic complexity: 375 Second operand 5 states. [2018-11-29 00:04:49,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:49,821 INFO L93 Difference]: Finished difference Result 2050 states and 2879 transitions. [2018-11-29 00:04:49,822 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:49,822 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2050 states and 2879 transitions. [2018-11-29 00:04:49,845 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2024 [2018-11-29 00:04:49,866 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2050 states to 2050 states and 2879 transitions. [2018-11-29 00:04:49,866 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2050 [2018-11-29 00:04:49,870 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2050 [2018-11-29 00:04:49,871 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2050 states and 2879 transitions. [2018-11-29 00:04:49,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:49,877 INFO L705 BuchiCegarLoop]: Abstraction has 2050 states and 2879 transitions. [2018-11-29 00:04:49,882 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2050 states and 2879 transitions. [2018-11-29 00:04:49,910 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2050 to 958. [2018-11-29 00:04:49,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 958 states. [2018-11-29 00:04:49,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 958 states to 958 states and 1323 transitions. [2018-11-29 00:04:49,916 INFO L728 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-11-29 00:04:49,916 INFO L608 BuchiCegarLoop]: Abstraction has 958 states and 1323 transitions. [2018-11-29 00:04:49,917 INFO L442 BuchiCegarLoop]: ======== Iteration 8============ [2018-11-29 00:04:49,917 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 958 states and 1323 transitions. [2018-11-29 00:04:49,926 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 932 [2018-11-29 00:04:49,926 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:49,926 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:49,927 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-11-29 00:04:49,927 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:49,927 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-11-29 00:04:49,932 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-11-29 00:04:49,932 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 4 times [2018-11-29 00:04:49,932 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,933 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,933 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,937 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:49,937 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:49,962 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:49,962 INFO L82 PathProgramCache]: Analyzing trace with hash -1803890900, now seen corresponding path program 1 times [2018-11-29 00:04:49,962 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:49,962 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:49,965 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,966 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:49,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:49,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:50,150 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:50,150 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:50,150 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:50,151 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:50,151 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:50,151 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:50,151 INFO L87 Difference]: Start difference. First operand 958 states and 1323 transitions. cyclomatic complexity: 366 Second operand 5 states. [2018-11-29 00:04:50,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:50,581 INFO L93 Difference]: Finished difference Result 2024 states and 2800 transitions. [2018-11-29 00:04:50,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:50,581 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2024 states and 2800 transitions. [2018-11-29 00:04:50,594 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1998 [2018-11-29 00:04:50,608 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2024 states to 2024 states and 2800 transitions. [2018-11-29 00:04:50,608 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2024 [2018-11-29 00:04:50,611 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2024 [2018-11-29 00:04:50,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2024 states and 2800 transitions. [2018-11-29 00:04:50,616 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:50,616 INFO L705 BuchiCegarLoop]: Abstraction has 2024 states and 2800 transitions. [2018-11-29 00:04:50,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2024 states and 2800 transitions. [2018-11-29 00:04:50,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2024 to 988. [2018-11-29 00:04:50,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-29 00:04:50,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1342 transitions. [2018-11-29 00:04:50,650 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-11-29 00:04:50,650 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1342 transitions. [2018-11-29 00:04:50,650 INFO L442 BuchiCegarLoop]: ======== Iteration 9============ [2018-11-29 00:04:50,650 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1342 transitions. [2018-11-29 00:04:50,657 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-29 00:04:50,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:50,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:50,659 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-11-29 00:04:50,659 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:50,659 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-11-29 00:04:50,663 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-11-29 00:04:50,663 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:50,663 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 5 times [2018-11-29 00:04:50,664 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:50,664 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:50,665 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,668 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:50,668 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,686 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:50,686 INFO L82 PathProgramCache]: Analyzing trace with hash 1479959146, now seen corresponding path program 1 times [2018-11-29 00:04:50,686 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:50,687 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:50,687 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,688 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:50,688 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:50,710 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:50,710 INFO L82 PathProgramCache]: Analyzing trace with hash -1057551404, now seen corresponding path program 1 times [2018-11-29 00:04:50,710 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:50,711 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:50,711 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,712 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:50,717 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:50,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:50,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:50,799 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:50,799 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:51,323 WARN L180 SmtUtils]: Spent 514.00 ms on a formula simplification. DAG size of input: 86 DAG size of output: 76 [2018-11-29 00:04:51,457 WARN L180 SmtUtils]: Spent 124.00 ms on a formula simplification that was a NOOP. DAG size: 64 [2018-11-29 00:04:51,474 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:51,475 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:51,475 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:51,475 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:51,477 INFO L127 ssoRankerPreferences]: Use exernal solver: true [2018-11-29 00:04:51,477 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:51,477 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:51,477 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:51,477 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-29 00:04:51,478 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:51,478 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:51,506 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,515 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,533 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,561 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,612 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,617 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,619 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,624 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,626 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,629 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,632 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,634 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,638 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,639 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,642 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,644 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,653 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,657 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,659 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,665 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,669 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,672 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,676 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,680 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,686 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,690 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,696 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,699 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,704 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,710 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:51,725 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,034 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:52,035 INFO L412 LassoAnalysis]: Checking for nontermination... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,041 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,041 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,050 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,050 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:04:52,072 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,073 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,094 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,094 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,135 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,135 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,168 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,169 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,289 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,289 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,302 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,302 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,327 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,327 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,330 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,330 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,355 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,355 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,358 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,358 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,381 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,381 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,387 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,387 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,409 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,409 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,413 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,413 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,436 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,436 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,442 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,442 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,471 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,471 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,478 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,478 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,500 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,500 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,504 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,504 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,529 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,529 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,533 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,533 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,557 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,557 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,560 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,560 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,582 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,582 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,585 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,585 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,605 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,606 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,608 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,608 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,629 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,629 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,633 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,633 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,660 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,660 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,664 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,665 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:04:52,686 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,686 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,690 INFO L445 LassoAnalysis]: Proved nontermination for one component. [2018-11-29 00:04:52,690 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 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:04:52,711 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2018-11-29 00:04:52,711 INFO L163 nArgumentSynthesizer]: Using integer mode. No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-11-29 00:04:52,738 INFO L151 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2018-11-29 00:04:52,739 INFO L163 nArgumentSynthesizer]: Using integer mode. [2018-11-29 00:04:52,794 INFO L452 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2018-11-29 00:04:52,799 INFO L216 LassoAnalysis]: Preferences: [2018-11-29 00:04:52,799 INFO L124 ssoRankerPreferences]: Compute integeral hull: false [2018-11-29 00:04:52,799 INFO L125 ssoRankerPreferences]: Enable LassoPartitioneer: true [2018-11-29 00:04:52,799 INFO L126 ssoRankerPreferences]: Term annotations enabled: false [2018-11-29 00:04:52,799 INFO L127 ssoRankerPreferences]: Use exernal solver: false [2018-11-29 00:04:52,799 INFO L128 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2018-11-29 00:04:52,800 INFO L129 ssoRankerPreferences]: Dump SMT script to file: false [2018-11-29 00:04:52,800 INFO L130 ssoRankerPreferences]: Path of dumped script: [2018-11-29 00:04:52,800 INFO L131 ssoRankerPreferences]: Filename of dumped script: kundu2_false-unreach-call_false-termination.cil.c_Iteration9_Loop [2018-11-29 00:04:52,800 INFO L132 ssoRankerPreferences]: MapElimAlgo: Frank [2018-11-29 00:04:52,800 INFO L282 LassoAnalysis]: Starting lasso preprocessing... [2018-11-29 00:04:52,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-11-29 00:04:52,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,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-11-29 00:04:52,833 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,841 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,941 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:52,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,021 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,061 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,113 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,152 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,156 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,161 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,171 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,214 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,238 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,245 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,248 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,263 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,266 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2018-11-29 00:04:53,742 WARN L180 SmtUtils]: Spent 172.00 ms on a formula simplification that was a NOOP. DAG size: 11 [2018-11-29 00:04:54,174 INFO L300 LassoAnalysis]: Preprocessing complete. [2018-11-29 00:04:54,180 INFO L497 LassoAnalysis]: Using template 'affine'. [2018-11-29 00:04:54,183 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,184 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,184 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,188 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,188 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,190 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,190 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,194 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,194 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,195 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,203 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,203 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,203 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,203 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,204 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,204 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,204 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,205 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,205 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,206 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,206 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,206 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,206 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,206 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,207 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,207 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,208 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,209 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,209 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,209 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,209 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,209 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,210 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,210 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,214 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,215 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,215 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,217 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,217 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,217 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,217 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,217 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,218 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,218 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,218 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,219 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,219 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,219 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,220 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,220 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,220 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,221 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,221 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,222 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,222 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,222 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,222 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,222 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,223 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,223 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,224 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,224 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,225 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,225 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,225 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,225 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,226 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,226 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,227 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,227 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,227 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,228 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,228 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,228 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,228 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,228 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,230 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,230 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,231 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,231 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,232 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,233 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,233 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,234 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,234 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,234 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,234 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,236 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,236 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,236 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,236 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,237 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,237 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,237 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,237 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,239 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,239 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,240 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,241 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,241 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,242 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,242 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,242 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,242 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,243 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,243 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,244 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,244 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,244 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,244 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,244 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,245 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,245 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,245 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,246 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,246 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,247 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,247 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,247 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,247 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,247 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,248 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,248 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,249 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,249 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,250 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,250 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,250 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,250 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,250 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,251 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,251 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,254 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,255 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,255 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,255 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,256 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,256 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,256 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,256 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,256 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,258 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,258 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,258 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,258 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,259 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,259 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,259 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,259 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,260 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,261 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,261 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,261 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,261 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,261 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,262 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,262 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,262 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,263 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,264 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,264 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,264 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,264 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,265 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,265 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,265 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,265 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,266 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,267 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,267 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,267 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,267 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,267 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,268 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,268 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,268 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,270 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,270 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,271 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,271 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,271 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,271 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,271 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,272 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,272 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,273 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,273 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,274 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,274 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,274 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,274 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,274 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,275 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,275 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,278 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,278 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,278 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,279 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,279 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,279 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,279 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,279 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,279 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,281 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,281 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,282 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,282 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,282 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,283 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,285 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,285 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,286 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,286 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,286 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,288 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,288 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,288 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,288 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,289 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,289 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,290 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,291 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,291 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,292 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,292 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,292 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,292 INFO L207 nArgumentSynthesizer]: 2 template conjuncts. [2018-11-29 00:04:54,292 INFO L402 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2018-11-29 00:04:54,292 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,293 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,293 INFO L497 LassoAnalysis]: Using template '2-nested'. [2018-11-29 00:04:54,294 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,294 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,295 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,295 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,295 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,295 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,296 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,296 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,300 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,301 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,301 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,301 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,302 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,302 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,307 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,308 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,308 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,308 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,309 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,309 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,309 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,309 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,309 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,314 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,315 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,315 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,316 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,318 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,318 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,318 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,319 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,319 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,320 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,320 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,324 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,324 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,325 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,325 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,325 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,329 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,329 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,335 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,336 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,337 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,337 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,337 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,339 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,339 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,340 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,341 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,342 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,345 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,345 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,345 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,345 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,347 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,347 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,348 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,348 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,349 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,349 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,352 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,352 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,352 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,352 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,352 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,353 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:54,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,354 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,357 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,357 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,359 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,359 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,361 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,361 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,362 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,362 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,362 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,362 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,362 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,368 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,369 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,369 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,369 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,370 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,370 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,373 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,373 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,380 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,380 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,380 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,381 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,381 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,381 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,382 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,382 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,386 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,386 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,387 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,387 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,387 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,388 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,395 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,395 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,396 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,396 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,396 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,396 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,396 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,397 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,397 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,399 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,399 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,399 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,401 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,401 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,401 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,402 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,402 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,402 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,402 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,402 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,403 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,404 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,404 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,404 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,404 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,405 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,406 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,407 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:54,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,408 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,408 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,409 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,409 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,409 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,409 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,409 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,410 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:54,410 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,415 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,421 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,421 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,421 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,422 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,422 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,427 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,427 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,428 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,428 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,428 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,428 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,432 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,433 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,433 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,433 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,440 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,440 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,440 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,441 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:54,441 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,447 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,447 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,448 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,448 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,448 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,448 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,448 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,449 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:54,449 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,454 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,455 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,455 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,455 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,455 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,455 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,456 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,456 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,462 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,462 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,463 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,463 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,463 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,463 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,463 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,463 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,466 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,467 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,467 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,467 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,468 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,468 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,468 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,468 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,468 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,472 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,477 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,478 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,478 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,478 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,478 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,479 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,483 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,483 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,483 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,488 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,489 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,489 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,489 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,489 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,490 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,490 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,490 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,491 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,494 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,494 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,495 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,495 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,495 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,496 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,501 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,501 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,501 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,502 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,504 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,507 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,507 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,507 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,507 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:54,508 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:54,508 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,508 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,512 INFO L497 LassoAnalysis]: Using template '3-nested'. [2018-11-29 00:04:54,512 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,513 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,513 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,513 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,513 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,513 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,514 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,514 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,518 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,519 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,519 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,519 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,519 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,519 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,523 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,523 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,525 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,526 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,526 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,526 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,526 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,527 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,527 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,527 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,528 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,528 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,529 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,529 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,529 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,529 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,529 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,530 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,530 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,532 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,532 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,532 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,532 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,532 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,533 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,533 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,533 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,537 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,538 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,538 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,538 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,538 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,539 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,541 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,541 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,541 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,541 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,542 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,542 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,542 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,543 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,544 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,544 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,545 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,545 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,547 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,547 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,548 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,548 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,548 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,549 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:54,549 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,550 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,551 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,551 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,551 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,552 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,552 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,552 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,552 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,553 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,554 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,554 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,554 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,555 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,555 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,555 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,556 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,557 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,557 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,557 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,558 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,558 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,558 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,559 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,559 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,560 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,561 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,562 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,562 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,563 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,564 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,564 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,565 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,565 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,565 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,565 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,565 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,566 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,567 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,567 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,568 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,568 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,568 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,568 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,569 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,569 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,569 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,570 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,571 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,571 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,571 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,572 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,572 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,572 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,572 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,572 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,574 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,574 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,574 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,575 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,576 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,576 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,586 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,587 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,587 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,587 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,587 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,587 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,588 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:54,588 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,589 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,590 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,590 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,590 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,591 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,591 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,591 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,592 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:54,592 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,596 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,597 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,597 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,598 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,598 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,598 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,598 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,599 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,599 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,617 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,617 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,618 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,618 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,618 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,619 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,620 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,620 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,621 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,621 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,621 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,621 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,624 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:54,624 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,628 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,628 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,629 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,629 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,629 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,629 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,629 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,630 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:54,630 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,634 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,635 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,635 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,635 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,641 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,641 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,644 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,645 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,645 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,645 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,646 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,646 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,646 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,646 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,646 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,648 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,648 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,649 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,653 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,653 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,653 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,653 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,654 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,654 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,665 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,666 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,666 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,666 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,666 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,666 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,667 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,667 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,676 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,676 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,677 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,677 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,677 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,677 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,677 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,678 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,682 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,686 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,686 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,686 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,686 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,686 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,687 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,687 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,688 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,691 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,691 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,692 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,692 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,692 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,692 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,692 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,696 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,698 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,698 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,702 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,702 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,703 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,703 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,703 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:54,703 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:54,703 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,707 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,707 INFO L497 LassoAnalysis]: Using template '4-nested'. [2018-11-29 00:04:54,707 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,711 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,712 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,712 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,718 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,718 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,719 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,719 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,724 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,727 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,728 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,728 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,736 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,737 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,742 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,742 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,742 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,743 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,743 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,743 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,744 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,744 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,745 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,746 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,749 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,749 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,749 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,749 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,749 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,750 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,750 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,761 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,767 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,768 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,768 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,768 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,768 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,768 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,769 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,769 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,775 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,776 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,776 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,776 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,777 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,777 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,777 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,779 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,779 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,785 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,785 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,785 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,785 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,786 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,786 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,788 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,788 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,788 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,789 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,791 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,791 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,792 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:54,792 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,793 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,794 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,794 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,794 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,794 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,795 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,795 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,795 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,795 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,800 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,800 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,809 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,809 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,809 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,809 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,810 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,811 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,811 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,813 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,813 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,814 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,814 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,814 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,814 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,814 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,815 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,815 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,820 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,820 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,821 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,821 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,822 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,824 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,828 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,829 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,829 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,832 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,832 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,832 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,832 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,833 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,833 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,836 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,836 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,840 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,840 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,840 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,840 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,841 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,845 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,846 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,846 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,846 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,847 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,847 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,847 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,850 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,850 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,851 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,854 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,854 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,854 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,855 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,855 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,855 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,855 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,856 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,862 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,862 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,863 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,863 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,863 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,864 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,864 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,864 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:54,865 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,870 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,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-11-29 00:04:54,874 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,874 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,875 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,875 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,875 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,876 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:54,876 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,887 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,888 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,888 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,889 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,893 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,893 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,893 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,894 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,894 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,896 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,896 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,897 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,897 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,897 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,897 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,897 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,900 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,900 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,901 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,905 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,905 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,905 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,906 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,906 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,906 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,910 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:54,910 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,912 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,913 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,913 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,913 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,928 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,928 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:54,928 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,929 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:54,929 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,930 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,931 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,931 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,931 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,932 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,932 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,932 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,938 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,938 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,944 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,944 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,944 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,944 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,945 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,945 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,945 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,948 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,950 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,950 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,951 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,951 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,951 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,951 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,952 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,952 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,979 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,980 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,980 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,980 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,980 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,981 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,981 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,981 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,981 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,989 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,989 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,990 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,990 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,990 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,990 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,991 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,991 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:54,991 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:54,996 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:54,996 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:54,997 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:54,997 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:54,997 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:54,997 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:54,997 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:54,998 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:55,001 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,002 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,002 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,012 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,012 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,013 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:55,013 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:55,013 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,016 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,016 INFO L339 nArgumentSynthesizer]: Template has degree 0. [2018-11-29 00:04:55,017 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:55,017 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:55,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,022 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,022 INFO L497 LassoAnalysis]: Using template '2-phase'. [2018-11-29 00:04:55,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-11-29 00:04:55,023 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,023 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,024 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,024 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,024 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,024 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,025 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,025 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,032 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,055 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,055 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,055 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,056 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,056 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,056 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,057 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,057 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,067 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,068 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,068 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,136 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,136 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,136 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,136 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,147 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,147 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,148 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,148 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,149 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,149 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,149 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,149 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,149 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,150 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,150 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,150 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,152 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,152 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,153 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,153 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,153 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,153 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,153 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,153 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,157 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,158 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,174 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,178 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,178 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,179 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,179 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,179 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,179 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,179 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,183 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,183 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,184 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,185 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,185 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,185 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,185 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,185 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,186 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,186 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,186 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,186 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,191 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,191 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,192 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,192 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,192 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,192 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,192 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,192 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,193 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,193 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,194 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,201 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,201 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,201 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,201 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,202 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,202 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,203 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,203 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,213 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,213 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,214 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,214 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,214 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,214 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,214 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,214 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,215 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,215 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,216 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,216 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,220 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,220 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,220 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,220 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,220 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,221 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,221 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,221 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,225 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,226 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,226 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,226 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,226 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,226 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,227 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,227 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,227 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,227 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,229 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,233 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,233 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,233 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,233 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,233 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,234 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,235 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,239 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,245 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,245 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,245 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,245 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,246 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,246 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,246 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,246 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,247 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,248 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,248 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,248 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,248 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,248 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,249 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,249 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,249 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,249 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,250 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,254 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,254 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,254 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,254 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,255 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,255 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,255 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,255 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,255 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,257 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,260 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,282 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,282 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,282 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,282 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,283 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,283 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,283 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,283 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,284 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,285 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,285 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,285 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,286 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,286 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,286 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,286 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,287 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,287 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,298 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,298 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,299 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,299 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,299 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,299 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,299 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,299 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,304 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,304 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,319 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,319 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,337 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,337 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,337 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,337 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,338 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,338 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,338 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,338 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,340 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,340 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,341 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,341 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,341 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,341 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,342 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,344 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,344 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,345 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,345 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,359 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,360 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,379 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,379 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,379 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,379 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,380 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,380 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,380 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:55,381 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,384 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,384 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,387 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,387 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,387 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,387 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,388 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,388 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,388 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,388 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,394 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,395 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,395 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,395 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,396 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,399 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,399 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,399 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,400 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,400 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,403 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,403 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,421 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,421 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,421 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,422 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,422 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,422 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,423 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,423 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,433 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,435 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,435 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,436 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,436 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,436 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,436 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,436 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,436 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,437 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,442 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,445 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,445 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,446 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,446 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,446 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,446 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,446 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,447 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,447 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,450 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,454 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,469 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,469 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,470 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,470 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,470 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,470 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,470 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,470 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,472 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,472 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,472 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,472 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,472 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,473 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,473 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,473 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,473 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,473 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,476 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,477 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,480 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,480 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:55,480 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,480 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,481 INFO L207 nArgumentSynthesizer]: 3 template conjuncts. [2018-11-29 00:04:55,481 INFO L402 nArgumentSynthesizer]: We have 3 Motzkin's Theorem applications. [2018-11-29 00:04:55,481 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,484 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,484 INFO L497 LassoAnalysis]: Using template '3-phase'. [2018-11-29 00:04:55,485 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,507 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,507 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,507 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,508 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,508 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,508 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,509 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,509 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,510 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,511 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,511 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,511 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,511 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,512 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,512 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,512 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,515 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,515 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,526 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,526 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,530 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,530 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,530 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,530 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,530 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,531 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,531 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,531 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,536 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,537 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,553 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,553 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,553 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,554 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,554 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,554 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,555 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,555 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,557 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,560 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,560 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,561 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,561 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,561 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,561 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,561 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,566 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,582 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,582 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,583 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,583 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,583 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,583 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,583 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,583 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,585 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,585 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,590 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,608 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,608 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,608 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,608 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,608 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,609 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,609 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,609 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,611 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,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-11-29 00:04:55,615 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,615 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,616 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,616 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,616 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,617 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,617 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,619 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,619 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,623 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,623 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,624 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,624 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,628 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,637 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,637 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,660 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,660 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,660 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,661 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,661 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,661 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,662 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,662 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,664 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,664 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,665 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,665 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,665 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,665 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,665 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,665 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,670 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,670 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,672 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,673 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,673 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,673 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,673 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,673 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,674 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,674 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,678 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,678 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,706 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,706 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,706 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,707 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,707 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,707 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,708 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,708 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,710 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,710 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,710 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,711 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,711 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,711 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,711 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,711 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,712 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,712 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,717 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,717 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,718 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,718 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,718 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,718 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,718 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,719 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,721 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,722 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,723 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,726 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,751 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,751 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,751 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,752 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,752 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,752 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,753 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,753 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,755 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,756 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,756 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,756 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,756 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,757 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,757 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,757 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,757 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,758 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,759 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,760 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,760 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,761 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,761 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,761 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,761 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,761 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,762 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,762 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,769 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,770 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,800 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,800 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,800 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,801 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,801 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,801 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,802 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,802 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,814 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,815 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,815 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,815 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,815 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,821 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,821 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,821 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,822 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,822 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,824 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,824 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,828 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,828 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,828 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,828 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,829 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,829 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,832 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,832 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,834 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,834 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,850 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,850 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,850 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,850 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,851 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,851 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,852 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,852 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,861 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,861 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,862 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,862 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,862 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,862 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,862 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:55,862 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,864 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:55,867 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,878 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,878 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,879 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,879 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,879 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,879 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,879 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,879 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,883 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,883 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,890 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,893 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,906 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,906 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,906 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,907 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,907 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,907 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,908 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,908 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,910 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,910 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,910 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,911 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,911 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,911 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,911 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,911 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,916 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,916 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,933 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,934 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,934 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,934 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,934 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,934 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,938 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,938 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,938 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,939 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,942 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,947 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,962 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,962 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,962 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,963 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,963 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,963 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,964 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,964 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,966 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,966 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,967 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,967 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,967 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,967 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,967 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,967 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,972 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,973 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,974 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,975 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:55,975 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:55,976 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:55,976 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:55,976 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:55,976 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:55,976 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:55,979 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:55,979 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:55,986 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:55,987 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,012 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,012 INFO L339 nArgumentSynthesizer]: Template has degree 2. [2018-11-29 00:04:56,012 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,013 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,013 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,013 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,013 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,014 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,015 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,015 INFO L497 LassoAnalysis]: Using template '4-phase'. [2018-11-29 00:04:56,016 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,016 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,016 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,016 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,017 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,017 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,017 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,018 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,018 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,019 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,031 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,031 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,032 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,032 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,032 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,032 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,032 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,039 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,040 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,052 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,053 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,054 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,054 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,054 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,054 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,054 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,059 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,059 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,061 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,061 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,062 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,062 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,062 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,062 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,062 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,062 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,066 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,066 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,073 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,074 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,074 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,074 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,074 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,075 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,075 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,075 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,077 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,077 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,097 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,097 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,098 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,098 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,098 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,098 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,098 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,098 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,099 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,100 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,101 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,101 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,103 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,103 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,103 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,104 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,104 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,104 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,105 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,105 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,106 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,107 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,107 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,108 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,108 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,108 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,108 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,109 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,109 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,111 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,111 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,129 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,129 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,129 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,130 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,130 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,130 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,131 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,132 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,149 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,156 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,157 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,157 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,157 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,157 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,157 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,157 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,161 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,163 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,164 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,165 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,165 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,165 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,166 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,166 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,166 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,170 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,170 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,171 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,172 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,182 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,182 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,183 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,183 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,183 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,183 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,184 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,185 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,186 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,187 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,187 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,187 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,187 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,188 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,190 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,190 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,191 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,192 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,193 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,193 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,194 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,194 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,194 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,194 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,194 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,195 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,195 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,196 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,197 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,228 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,228 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,228 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,229 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,229 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,229 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,230 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,230 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,231 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,231 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,232 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,232 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,232 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,232 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,232 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,232 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,233 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,234 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,238 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,239 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,239 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,239 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,239 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,239 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,239 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,240 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,240 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,245 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,269 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,269 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,269 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,269 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,270 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,270 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,271 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,271 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,287 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,287 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,288 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,288 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,288 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,288 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,288 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,288 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,293 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,296 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,316 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,317 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,317 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,317 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,317 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,321 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,321 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,321 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,322 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,322 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,325 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,326 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,340 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,340 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,340 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,340 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,341 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,341 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,342 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,342 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,343 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,343 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,344 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,344 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,344 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,344 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,344 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,345 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,346 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,346 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,365 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,365 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,365 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,366 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,366 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,366 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,366 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,371 INFO L402 nArgumentSynthesizer]: We have 10 Motzkin's Theorem applications. [2018-11-29 00:04:56,371 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,390 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,390 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,405 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,405 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,405 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,406 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,406 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,406 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,407 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,407 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,414 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,415 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,415 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,416 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,416 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,416 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,416 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,416 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,420 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,420 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,426 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,426 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,427 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,427 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,427 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,427 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,427 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,427 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,432 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,433 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,456 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,469 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,469 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,469 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,469 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,469 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,470 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,470 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,471 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,480 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,481 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,481 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,481 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,481 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,481 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,482 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,487 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,487 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,489 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,489 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,493 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,493 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,493 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,493 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,493 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,493 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,494 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,494 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,498 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,522 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,522 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,522 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,522 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,522 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,523 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,524 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,524 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,531 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,531 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,537 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,537 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:56,537 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,537 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,538 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,538 INFO L207 nArgumentSynthesizer]: 5 template conjuncts. [2018-11-29 00:04:56,538 INFO L402 nArgumentSynthesizer]: We have 5 Motzkin's Theorem applications. [2018-11-29 00:04:56,539 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,540 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,540 INFO L497 LassoAnalysis]: Using template '2-lex'. [2018-11-29 00:04:56,540 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,544 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,544 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,544 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,544 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,544 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,545 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,545 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,545 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,550 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,551 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,574 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,574 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,574 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,575 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,575 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,575 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,575 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,575 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,578 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,579 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,579 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,579 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,579 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,579 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,582 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,582 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,582 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,582 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,586 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,587 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,587 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,587 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,588 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,588 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,588 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,588 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,588 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,593 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,600 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,600 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,620 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,620 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,620 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,620 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,621 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,621 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,621 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,622 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,631 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,632 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,632 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,632 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,632 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,632 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,633 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,633 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,633 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,633 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,640 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,641 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,641 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,641 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,641 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,641 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,642 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,642 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,642 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,642 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,646 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,646 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,674 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,674 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,674 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,675 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,675 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,675 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,675 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,675 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,677 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,678 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,678 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,678 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,678 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,678 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,679 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,679 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,679 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,684 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,684 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,685 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,685 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,685 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,685 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,685 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,685 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,689 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,689 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,694 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,694 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,724 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,724 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,724 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,724 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,725 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,725 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,725 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,725 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,728 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,728 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,729 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,735 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,735 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,739 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,739 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,739 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,739 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,740 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,740 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,740 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,740 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,742 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,743 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,776 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,777 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,777 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,777 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,777 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,777 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,778 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,778 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,779 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,780 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,780 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,780 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,780 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,781 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,781 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,781 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,781 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,781 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,783 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,783 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,784 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,784 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,784 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,784 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,784 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,784 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,785 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,785 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,787 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,787 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,823 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,823 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,823 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,823 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,823 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,824 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,824 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,824 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,826 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,826 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,826 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,827 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,827 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,827 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,827 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,827 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,828 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,830 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,835 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,835 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,836 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,836 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,836 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,836 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,836 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,836 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,840 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,840 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,852 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,853 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,880 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,880 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,880 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,881 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,881 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,881 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,881 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,881 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,884 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,884 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,885 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,885 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,885 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,885 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,885 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,885 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,886 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,891 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,891 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,891 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,892 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,892 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,892 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,892 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,892 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,892 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,895 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,902 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,902 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,932 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,932 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,932 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,932 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,932 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:56,933 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,933 INFO L402 nArgumentSynthesizer]: We have 8 Motzkin's Theorem applications. [2018-11-29 00:04:56,933 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,936 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,936 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,936 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,936 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,936 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,937 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,937 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,937 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,937 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,937 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,943 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,946 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,946 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,946 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,947 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,947 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,947 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,947 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,947 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,948 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,953 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,953 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:56,984 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,984 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,984 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,985 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,985 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,985 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,986 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,986 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:56,997 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:56,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-11-29 00:04:56,997 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:56,998 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:56,998 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:56,998 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:56,998 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:56,998 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:56,998 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:56,999 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,003 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,003 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,004 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,004 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,004 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,004 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,004 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,004 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,008 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,008 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,014 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,014 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,043 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,043 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,043 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,043 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,043 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,043 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,044 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,044 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,046 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,046 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,047 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,047 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,047 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,047 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,047 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,047 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,048 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,048 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,050 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,051 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,051 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,051 INFO L339 nArgumentSynthesizer]: Template has degree 1. [2018-11-29 00:04:57,051 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,051 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,051 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,052 INFO L207 nArgumentSynthesizer]: 4 template conjuncts. [2018-11-29 00:04:57,052 INFO L402 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2018-11-29 00:04:57,052 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,054 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,054 INFO L497 LassoAnalysis]: Using template '3-lex'. [2018-11-29 00:04:57,054 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,095 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,095 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,095 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,095 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,096 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,096 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,096 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,097 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,099 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,100 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,100 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,100 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,101 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,101 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,101 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,101 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,102 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,102 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,118 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,118 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,118 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,119 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,119 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,119 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,119 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,119 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,120 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,120 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,129 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,151 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,151 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,151 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,151 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,151 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,152 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,153 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,153 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,158 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,158 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,158 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,158 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,159 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,159 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,159 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,159 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,166 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,166 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,195 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,196 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,196 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,196 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,196 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,197 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,197 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,197 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,197 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,202 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,203 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,224 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,224 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,224 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,224 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,225 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,225 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,226 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,226 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,229 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,229 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,230 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,230 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,230 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,230 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,230 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,230 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,233 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,233 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,241 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,242 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,242 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,242 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,242 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,243 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,243 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,243 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,244 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:57,244 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,251 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,257 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,284 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,284 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,284 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,285 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,285 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,285 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,286 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,286 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,292 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,292 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,293 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,293 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,293 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,293 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,293 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,293 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,294 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,294 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,300 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,301 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,301 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,301 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,301 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,301 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,302 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,302 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,306 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,306 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,315 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,318 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,351 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,351 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,351 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,351 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,352 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,352 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,352 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,353 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,356 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,356 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,357 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,357 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,357 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,357 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,357 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,357 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,358 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,358 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,364 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,364 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,367 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,367 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,367 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,367 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,367 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,367 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,368 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,368 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,374 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,374 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,412 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,412 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,412 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,413 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,413 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,413 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,413 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,414 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,416 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,417 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,417 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,417 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,418 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,418 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,418 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,418 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,419 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,419 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,428 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,428 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,429 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,429 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,429 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,429 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,429 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,430 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,433 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:57,434 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,441 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,442 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,475 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,475 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,475 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,475 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,476 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,476 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,477 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:57,477 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,493 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,494 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,494 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,494 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,494 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,495 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,495 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,495 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,496 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,496 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,499 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,500 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,500 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,500 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,500 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,501 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,501 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,501 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,501 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,502 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,505 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,506 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,539 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,539 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,539 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,540 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,540 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,540 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,541 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:57,541 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,546 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,546 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,546 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,547 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,547 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,547 INFO L206 nArgumentSynthesizer]: 2 loop disjuncts [2018-11-29 00:04:57,547 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,553 INFO L402 nArgumentSynthesizer]: We have 12 Motzkin's Theorem applications. [2018-11-29 00:04:57,553 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,561 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,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-11-29 00:04:57,561 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,562 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,562 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,562 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,562 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,562 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,566 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,566 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,591 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,591 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,616 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,616 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,616 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,617 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,617 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,617 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,618 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,618 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,622 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,622 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,622 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,623 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,623 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,623 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,623 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,623 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,628 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,628 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,665 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,668 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,668 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,669 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,669 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,669 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,669 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,669 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,673 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,673 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,680 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,680 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,704 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,704 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,704 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,705 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,705 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,705 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,706 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,706 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,716 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,716 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,716 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,717 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,717 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,717 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,717 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,717 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,721 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,721 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,727 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,728 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,728 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,728 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,728 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,728 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,728 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,729 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,729 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,729 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,738 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,738 INFO L122 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSES Number of strict supporting invariants: 0 Number of non-strict supporting invariants: 1 Consider only non-deceasing supporting invariants: true Simplify termination arguments: true Simplify supporting invariants: trueOverapproximate stem: false [2018-11-29 00:04:57,766 WARN L334 nArgumentSynthesizer]: Using a linear SMT query and a templates of degree > 0, hence this method is incomplete. [2018-11-29 00:04:57,766 INFO L339 nArgumentSynthesizer]: Template has degree 3. [2018-11-29 00:04:57,766 INFO L352 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2018-11-29 00:04:57,766 INFO L205 nArgumentSynthesizer]: 1 stem disjuncts [2018-11-29 00:04:57,767 INFO L206 nArgumentSynthesizer]: 1 loop disjuncts [2018-11-29 00:04:57,767 INFO L207 nArgumentSynthesizer]: 6 template conjuncts. [2018-11-29 00:04:57,767 INFO L402 nArgumentSynthesizer]: We have 6 Motzkin's Theorem applications. [2018-11-29 00:04:57,767 INFO L403 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2018-11-29 00:04:57,770 INFO L530 LassoAnalysis]: Proving termination failed for this template and these settings. [2018-11-29 00:04:57,771 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:57,771 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:57,771 INFO L87 Difference]: Start difference. First operand 988 states and 1342 transitions. cyclomatic complexity: 355 Second operand 3 states. [2018-11-29 00:04:58,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:58,338 INFO L93 Difference]: Finished difference Result 988 states and 1326 transitions. [2018-11-29 00:04:58,339 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:58,339 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 988 states and 1326 transitions. [2018-11-29 00:04:58,346 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-29 00:04:58,362 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 988 states to 988 states and 1326 transitions. [2018-11-29 00:04:58,362 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 988 [2018-11-29 00:04:58,368 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 988 [2018-11-29 00:04:58,368 INFO L73 IsDeterministic]: Start isDeterministic. Operand 988 states and 1326 transitions. [2018-11-29 00:04:58,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:58,380 INFO L705 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-29 00:04:58,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 988 states and 1326 transitions. [2018-11-29 00:04:58,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 988 to 988. [2018-11-29 00:04:58,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 988 states. [2018-11-29 00:04:58,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 988 states to 988 states and 1326 transitions. [2018-11-29 00:04:58,420 INFO L728 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-29 00:04:58,420 INFO L608 BuchiCegarLoop]: Abstraction has 988 states and 1326 transitions. [2018-11-29 00:04:58,420 INFO L442 BuchiCegarLoop]: ======== Iteration 10============ [2018-11-29 00:04:58,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 988 states and 1326 transitions. [2018-11-29 00:04:58,432 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 962 [2018-11-29 00:04:58,432 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:58,432 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:58,436 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-11-29 00:04:58,436 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-11-29 00:04:58,436 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-11-29 00:04:58,437 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-11-29 00:04:58,437 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:58,437 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 6 times [2018-11-29 00:04:58,437 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:58,437 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:58,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,442 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:58,442 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:58,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:58,465 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:58,465 INFO L82 PathProgramCache]: Analyzing trace with hash 779870938, now seen corresponding path program 1 times [2018-11-29 00:04:58,466 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:58,466 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,466 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:04:58,466 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:58,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:58,582 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:58,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:04:58,583 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:58,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:04:58,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:04:58,583 INFO L87 Difference]: Start difference. First operand 988 states and 1326 transitions. cyclomatic complexity: 339 Second operand 3 states. [2018-11-29 00:04:58,870 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:58,871 INFO L93 Difference]: Finished difference Result 1925 states and 2547 transitions. [2018-11-29 00:04:58,873 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:04:58,874 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1925 states and 2547 transitions. [2018-11-29 00:04:58,890 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1900 [2018-11-29 00:04:58,904 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1925 states to 1925 states and 2547 transitions. [2018-11-29 00:04:58,904 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 1925 [2018-11-29 00:04:58,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 1925 [2018-11-29 00:04:58,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1925 states and 2547 transitions. [2018-11-29 00:04:58,916 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:58,916 INFO L705 BuchiCegarLoop]: Abstraction has 1925 states and 2547 transitions. [2018-11-29 00:04:58,920 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1925 states and 2547 transitions. [2018-11-29 00:04:58,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1925 to 1909. [2018-11-29 00:04:58,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1909 states. [2018-11-29 00:04:58,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1909 states to 1909 states and 2527 transitions. [2018-11-29 00:04:58,962 INFO L728 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-11-29 00:04:58,962 INFO L608 BuchiCegarLoop]: Abstraction has 1909 states and 2527 transitions. [2018-11-29 00:04:58,962 INFO L442 BuchiCegarLoop]: ======== Iteration 11============ [2018-11-29 00:04:58,962 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1909 states and 2527 transitions. [2018-11-29 00:04:58,979 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 1884 [2018-11-29 00:04:58,979 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:58,979 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:58,983 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-11-29 00:04:58,983 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-11-29 00:04:58,984 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-11-29 00:04:58,984 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-11-29 00:04:58,984 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:58,984 INFO L82 PathProgramCache]: Analyzing trace with hash -1713364885, now seen corresponding path program 7 times [2018-11-29 00:04:58,984 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:58,985 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:58,989 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,989 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:58,990 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:58,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,004 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,012 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,012 INFO L82 PathProgramCache]: Analyzing trace with hash -991600037, now seen corresponding path program 1 times [2018-11-29 00:04:59,012 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,012 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,016 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,016 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:59,259 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-11-29 00:04:59,259 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:59,259 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-29 00:04:59,260 INFO L811 eck$LassoCheckResult]: loop already infeasible [2018-11-29 00:04:59,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-29 00:04:59,260 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-29 00:04:59,260 INFO L87 Difference]: Start difference. First operand 1909 states and 2527 transitions. cyclomatic complexity: 619 Second operand 5 states. [2018-11-29 00:04:59,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:04:59,562 INFO L93 Difference]: Finished difference Result 3270 states and 4376 transitions. [2018-11-29 00:04:59,565 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-29 00:04:59,565 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 3270 states and 4376 transitions. [2018-11-29 00:04:59,589 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 3203 [2018-11-29 00:04:59,612 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 3270 states to 3270 states and 4376 transitions. [2018-11-29 00:04:59,612 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 3270 [2018-11-29 00:04:59,619 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 3270 [2018-11-29 00:04:59,619 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3270 states and 4376 transitions. [2018-11-29 00:04:59,627 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:04:59,628 INFO L705 BuchiCegarLoop]: Abstraction has 3270 states and 4376 transitions. [2018-11-29 00:04:59,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3270 states and 4376 transitions. [2018-11-29 00:04:59,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3270 to 1735. [2018-11-29 00:04:59,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1735 states. [2018-11-29 00:04:59,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1735 states to 1735 states and 2280 transitions. [2018-11-29 00:04:59,677 INFO L728 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-11-29 00:04:59,677 INFO L608 BuchiCegarLoop]: Abstraction has 1735 states and 2280 transitions. [2018-11-29 00:04:59,677 INFO L442 BuchiCegarLoop]: ======== Iteration 12============ [2018-11-29 00:04:59,677 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1735 states and 2280 transitions. [2018-11-29 00:04:59,689 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 1700 [2018-11-29 00:04:59,689 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:04:59,689 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:04:59,689 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-11-29 00:04:59,694 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:04:59,694 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-11-29 00:04:59,694 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-11-29 00:04:59,698 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,698 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 1 times [2018-11-29 00:04:59,698 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,698 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,699 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,699 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 1 times [2018-11-29 00:04:59,722 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,722 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,723 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,723 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:04:59,730 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:04:59,730 INFO L82 PathProgramCache]: Analyzing trace with hash -1596403455, now seen corresponding path program 1 times [2018-11-29 00:04:59,730 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:04:59,730 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:04:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,731 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:04:59,731 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:04:59,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:04:59,906 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:04:59,907 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:04:59,907 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:00,201 WARN L180 SmtUtils]: Spent 292.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-29 00:05:00,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:00,256 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:00,256 INFO L87 Difference]: Start difference. First operand 1735 states and 2280 transitions. cyclomatic complexity: 548 Second operand 3 states. [2018-11-29 00:05:00,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:00,295 INFO L93 Difference]: Finished difference Result 2774 states and 3602 transitions. [2018-11-29 00:05:00,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:00,297 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2774 states and 3602 transitions. [2018-11-29 00:05:00,308 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2709 [2018-11-29 00:05:00,327 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2774 states to 2774 states and 3602 transitions. [2018-11-29 00:05:00,327 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2774 [2018-11-29 00:05:00,332 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2774 [2018-11-29 00:05:00,334 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2774 states and 3602 transitions. [2018-11-29 00:05:00,340 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:00,341 INFO L705 BuchiCegarLoop]: Abstraction has 2774 states and 3602 transitions. [2018-11-29 00:05:00,346 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2774 states and 3602 transitions. [2018-11-29 00:05:00,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2774 to 2682. [2018-11-29 00:05:00,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2682 states. [2018-11-29 00:05:00,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2682 states to 2682 states and 3490 transitions. [2018-11-29 00:05:00,392 INFO L728 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-11-29 00:05:00,392 INFO L608 BuchiCegarLoop]: Abstraction has 2682 states and 3490 transitions. [2018-11-29 00:05:00,392 INFO L442 BuchiCegarLoop]: ======== Iteration 13============ [2018-11-29 00:05:00,392 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2682 states and 3490 transitions. [2018-11-29 00:05:00,405 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-29 00:05:00,407 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:00,407 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:00,408 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-11-29 00:05:00,408 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:00,408 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-11-29 00:05:00,408 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-11-29 00:05:00,408 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,408 INFO L82 PathProgramCache]: Analyzing trace with hash 918352559, now seen corresponding path program 1 times [2018-11-29 00:05:00,408 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,409 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,409 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,409 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:00,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:00,485 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:00,485 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-29 00:05:00,485 INFO L799 eck$LassoCheckResult]: stem already infeasible [2018-11-29 00:05:00,485 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,485 INFO L82 PathProgramCache]: Analyzing trace with hash 1012946901, now seen corresponding path program 2 times [2018-11-29 00:05:00,486 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,486 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,486 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,486 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,730 WARN L180 SmtUtils]: Spent 229.00 ms on a formula simplification. DAG size of input: 23 DAG size of output: 21 [2018-11-29 00:05:00,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:00,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:00,757 INFO L87 Difference]: Start difference. First operand 2682 states and 3490 transitions. cyclomatic complexity: 811 Second operand 3 states. [2018-11-29 00:05:00,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:00,770 INFO L93 Difference]: Finished difference Result 2660 states and 3467 transitions. [2018-11-29 00:05:00,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:00,771 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 2660 states and 3467 transitions. [2018-11-29 00:05:00,781 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-29 00:05:00,796 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-11-29 00:05:00,796 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 2660 [2018-11-29 00:05:00,799 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 2660 [2018-11-29 00:05:00,799 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2660 states and 3467 transitions. [2018-11-29 00:05:00,803 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:00,803 INFO L705 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-29 00:05:00,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2660 states and 3467 transitions. [2018-11-29 00:05:00,836 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2660 to 2660. [2018-11-29 00:05:00,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2660 states. [2018-11-29 00:05:00,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2660 states to 2660 states and 3467 transitions. [2018-11-29 00:05:00,844 INFO L728 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-29 00:05:00,844 INFO L608 BuchiCegarLoop]: Abstraction has 2660 states and 3467 transitions. [2018-11-29 00:05:00,844 INFO L442 BuchiCegarLoop]: ======== Iteration 14============ [2018-11-29 00:05:00,844 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 2660 states and 3467 transitions. [2018-11-29 00:05:00,852 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 2617 [2018-11-29 00:05:00,852 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:00,852 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:00,853 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-11-29 00:05:00,853 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:00,853 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-11-29 00:05:00,853 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-11-29 00:05:00,854 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,854 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 2 times [2018-11-29 00:05:00,854 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,854 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,855 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:00,855 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,865 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,865 INFO L82 PathProgramCache]: Analyzing trace with hash 1336445219, now seen corresponding path program 1 times [2018-11-29 00:05:00,865 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,865 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,866 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:00,866 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:00,871 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:00,871 INFO L82 PathProgramCache]: Analyzing trace with hash 2050962807, now seen corresponding path program 1 times [2018-11-29 00:05:00,871 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:00,871 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:00,871 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,872 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:00,872 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:00,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-29 00:05:00,935 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-29 00:05:00,936 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-29 00:05:00,936 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-29 00:05:01,362 WARN L180 SmtUtils]: Spent 425.00 ms on a formula simplification. DAG size of input: 26 DAG size of output: 24 [2018-11-29 00:05:01,381 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-29 00:05:01,382 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-29 00:05:01,382 INFO L87 Difference]: Start difference. First operand 2660 states and 3467 transitions. cyclomatic complexity: 810 Second operand 3 states. [2018-11-29 00:05:01,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-29 00:05:01,423 INFO L93 Difference]: Finished difference Result 4373 states and 5643 transitions. [2018-11-29 00:05:01,425 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-29 00:05:01,426 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 4373 states and 5643 transitions. [2018-11-29 00:05:01,439 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-11-29 00:05:01,463 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-11-29 00:05:01,463 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 4373 [2018-11-29 00:05:01,469 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 4373 [2018-11-29 00:05:01,469 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4373 states and 5643 transitions. [2018-11-29 00:05:01,477 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2018-11-29 00:05:01,477 INFO L705 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-29 00:05:01,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4373 states and 5643 transitions. [2018-11-29 00:05:01,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4373 to 4373. [2018-11-29 00:05:01,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4373 states. [2018-11-29 00:05:01,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4373 states to 4373 states and 5643 transitions. [2018-11-29 00:05:01,540 INFO L728 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-29 00:05:01,540 INFO L608 BuchiCegarLoop]: Abstraction has 4373 states and 5643 transitions. [2018-11-29 00:05:01,541 INFO L442 BuchiCegarLoop]: ======== Iteration 15============ [2018-11-29 00:05:01,541 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 4373 states and 5643 transitions. [2018-11-29 00:05:01,557 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 4314 [2018-11-29 00:05:01,557 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2018-11-29 00:05:01,557 INFO L119 BuchiIsEmpty]: Starting construction of run [2018-11-29 00:05:01,558 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-11-29 00:05:01,558 INFO L867 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-29 00:05:01,558 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-11-29 00:05:01,558 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-11-29 00:05:01,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,558 INFO L82 PathProgramCache]: Analyzing trace with hash -1571176403, now seen corresponding path program 3 times [2018-11-29 00:05:01,558 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,559 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,566 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,566 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,583 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,583 INFO L82 PathProgramCache]: Analyzing trace with hash -1519873096, now seen corresponding path program 1 times [2018-11-29 00:05:01,583 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,583 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,584 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-29 00:05:01,584 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-29 00:05:01,595 INFO L82 PathProgramCache]: Analyzing trace with hash -844664348, now seen corresponding path program 1 times [2018-11-29 00:05:01,595 INFO L223 ckRefinementStrategy]: Switched to mode SMTINTERPOL_TREE_INTERPOLANTS [2018-11-29 00:05:01,595 INFO L69 tionRefinementEngine]: Using refinement strategy CamelRefinementStrategy [2018-11-29 00:05:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,599 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-29 00:05:01,599 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-29 00:05:01,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-29 00:05:01,771 WARN L180 SmtUtils]: Spent 149.00 ms on a formula simplification. DAG size of input: 29 DAG size of output: 27 [2018-11-29 00:05:02,145 WARN L180 SmtUtils]: Spent 352.00 ms on a formula simplification. DAG size of input: 105 DAG size of output: 94 [2018-11-29 00:05:02,280 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 29.11 12:05:02 BoogieIcfgContainer [2018-11-29 00:05:02,280 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2018-11-29 00:05:02,280 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-29 00:05:02,280 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-29 00:05:02,281 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-29 00:05:02,281 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 12:04:45" (3/4) ... [2018-11-29 00:05:02,285 INFO L141 WitnessPrinter]: Generating witness for non-termination counterexample [2018-11-29 00:05:02,361 INFO L145 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2018-11-29 00:05:02,362 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-29 00:05:02,366 INFO L168 Benchmark]: Toolchain (without parser) took 18575.66 ms. Allocated memory was 1.0 GB in the beginning and 1.3 GB in the end (delta: 296.2 MB). Free memory was 946.0 MB in the beginning and 1.0 GB in the end (delta: -56.1 MB). Peak memory consumption was 240.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,367 INFO L168 Benchmark]: CDTParser took 0.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-29 00:05:02,368 INFO L168 Benchmark]: CACSL2BoogieTranslator took 522.42 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 MB in the end (delta: 16.1 MB). Peak memory consumption was 16.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,368 INFO L168 Benchmark]: Boogie Procedure Inliner took 59.26 ms. Allocated memory is still 1.0 GB. Free memory was 929.9 MB in the beginning and 924.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,370 INFO L168 Benchmark]: Boogie Preprocessor took 141.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,371 INFO L168 Benchmark]: RCFGBuilder took 1401.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,371 INFO L168 Benchmark]: BuchiAutomizer took 16360.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 36.1 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,380 INFO L168 Benchmark]: Witness Printer took 85.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2018-11-29 00:05:02,386 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.19 ms. Allocated memory is still 1.0 GB. Free memory is still 972.8 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 522.42 ms. Allocated memory is still 1.0 GB. Free memory was 946.0 MB in the beginning and 929.9 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 59.26 ms. Allocated memory is still 1.0 GB. Free memory was 929.9 MB in the beginning and 924.5 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 141.64 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 112.2 MB). Free memory was 924.5 MB in the beginning and 1.1 GB in the end (delta: -175.1 MB). Peak memory consumption was 15.0 MB. Max. memory is 11.5 GB. * RCFGBuilder took 1401.43 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 52.3 MB). Peak memory consumption was 52.3 MB. Max. memory is 11.5 GB. * BuchiAutomizer took 16360.43 ms. Allocated memory was 1.1 GB in the beginning and 1.3 GB in the end (delta: 184.0 MB). Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 36.1 MB). Peak memory consumption was 220.1 MB. Max. memory is 11.5 GB. * Witness Printer took 85.23 ms. Allocated memory is still 1.3 GB. Free memory was 1.0 GB in the beginning and 1.0 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. 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 16.2s and 15 iterations. TraceHistogramMax:2. Analysis of lassos took 11.0s. Construction of modules took 2.9s. Büchi inclusion checks took 0.9s. Highest rank in rank-based complementation 0. Minimization of det autom 14. Minimization of nondet autom 0. Automata minimization 0.5s AutomataMinimizationTime, 14 MinimizatonAttempts, 4182 StatesRemovedByMinimization, 8 NontrivialMinimizations. Non-live state removal took 0.3s 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, 2.9s 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: 8ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 12 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 18 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - 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@2fa7f41e=0, tmp=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@6d57ddba=0, C_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@200aadc9=0, data_0=0, kernel_st=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@d0e52d1=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@bfd7ccc=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@78412628=0, tmp=0, C_1_pr=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@62cab9ea=0, P_1_st=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@59c65398=0, P_2_ev=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@106b575e=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...